Edge‐minimum saturated k‐planar drawings

For a class D of drawings of loopless (multi‐)graphs in the plane, a drawing D ∈ D is saturated when the addition of any edge to D results in D ′ ∉ D—this is analogous to saturated graphs in a graph class as introduced by Turán and Erdős, Hajnal, and Moon. We focus on k‐planar drawings, that is, gra...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of graph theory Jg. 106; H. 4; S. 741 - 762
Hauptverfasser: Chaplick, Steven, Klute, Fabian, Parada, Irene, Rollin, Jonathan, Ueckerdt, Torsten
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Hoboken Wiley Subscription Services, Inc 01.10.2024
Schlagworte:
Graph theory
Graphs
k‐planar graphs
multigraphs
saturated drawings
ISSN:0364-9024, 1097-0118
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:For a class D of drawings of loopless (multi‐)graphs in the plane, a drawing D ∈ D is saturated when the addition of any edge to D results in D ′ ∉ D—this is analogous to saturated graphs in a graph class as introduced by Turán and Erdős, Hajnal, and Moon. We focus on k‐planar drawings, that is, graphs drawn in the plane where each edge is crossed at most k times, and the classes D of all k‐planar drawings obeying a number of restrictions, such as having no crossing incident edges, no pair of edges crossing more than once, or no edge crossing itself. While saturated k‐planar drawings are the focus of several prior works, tight bounds on how sparse these can be are not well understood. We establish a generic framework to determine the minimum number of edges among all n‐vertex saturated k‐planar drawings in many natural classes. For example, when incident crossings, multicrossings and selfcrossings are all allowed, the sparsest n‐vertex saturated k‐planar drawings have 2 k − ( k mod 2 ) ( n − 1 ) edges for any k ≥ 4, while if all that is forbidden, the sparsest such drawings have 2 ( k + 1 ) k ( k − 1 ) ( n − 1 ) edges for any k ≥ 6.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.23097