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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of graph theory Ročník 106; číslo 4; s. 741 - 762
Hlavní autori:	Chaplick, Steven, Klute, Fabian, Parada, Irene, Rollin, Jonathan, Ueckerdt, Torsten
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Wiley Subscription Services, Inc 01.10.2024
Predmet:	Graph theory Graphs k‐planar graphs multigraphs saturated drawings
ISSN:	0364-9024, 1097-0118
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!