Edge-minimum saturated k-planar drawings

DOI10.1002/JGT.23097MaRDI QIDQ6565810zbMATH OpenFDO

Authors Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt

Publication date 2 July 2024

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.23097

zbMATH Keywords

\(k\)-planar graphsmultigraphssaturated drawings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Edge-minimum saturated \(k\)-planar drawings
• Saturated 2-plane drawings with few edges
• Saturated simple and \(k\)-simple topological graphs
• \(k\)-planar graphs
• Graph Drawing

Cites work

• A crossing lemma for multigraphs
• A generalization of diagonal flips in a convex polygon
• A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
• A Problem in Graph Theory
• A survey of minimum saturated graphs
• A Turán-type theorem on chords of a convex polygon
• An annotated bibliography on 1-planarity
• Beyond outerplanarity
• Beyond planar graphs. Communications of National Institute of Informatics (NII) Shonan meetings, Shonan, Japan, November 27 -- December 1, 2016
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• Edge-minimum saturated \(k\)-planar drawings
• Extending simple drawings
• Gap-planar graphs
• Graphs drawn with few crossings per edge
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Improvements on the density of maximal 1-planar graphs
• Improving the crossing lemma by finding more crossings in sparse graphs
• Inserting one edge into a simple drawing is hard
• On line arrangements in the hyperbolic plane
• On Optimal 2- and 3-Planar Graphs
• On the density of maximal 1-planar graphs
• On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens
• On the number of edges of separated multigraphs
• On topological graphs with at most four crossings per edge
• Saturated 2-plane drawings with few edges
• Saturated simple and 2-simple topological graphs with few edges
• Saturated simple and \(k\)-simple topological graphs
• The graph crossing number and its variants: a survey
• The number of crossings in multigraphs with no empty lens
• The number of edges in maximal 2-planar graphs
• What we know and what we do not know about Turán numbers

Cited in

(2)

• Edge-minimum saturated \(k\)-planar drawings
• Saturated 2-plane drawings with few edges

This page was built for publication: Edge-minimum saturated \(k\)-planar drawings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565810)