The thickness of fan-planar graphs is at most three

The thickness of fan-planar graphs is at most three

We prove that in any strongly fan-planar drawing of a graph G the edges can be colored with at most three colors, such that no two edges of the same color cross. This implies that the thickness of strongly fan-planar graphs is at most three. If G is bipartite, then two colors suffice to color the ed...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Cheong, Otfried, Pfister, Maximilian, Schlipf, Lena
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Computational Geometry
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We prove that in any strongly fan-planar drawing of a graph G the edges can be colored with at most three colors, such that no two edges of the same color cross. This implies that the thickness of strongly fan-planar graphs is at most three. If G is bipartite, then two colors suffice to color the edges in this way.
DOI:10.48550/arxiv.2208.12324