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

Full description

Bibliographic Details

Published in:	Journal of graph theory Vol. 106; no. 4; pp. 741 - 762
Main Authors:	Chaplick, Steven, Klute, Fabian, Parada, Irene, Rollin, Jonathan, Ueckerdt, Torsten
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc 01.10.2024
Subjects:	Graph theory Graphs k‐planar graphs multigraphs saturated drawings
ISSN:	0364-9024, 1097-0118
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!