Saturated simple and \(k\)-simple topological graphs

DOI10.1016/j.comgeo.2014.10.008zbMath1312.05040arXiv1309.1046OpenAlexW1996954119MaRDI QIDQ2344053

János Pach, Radoš Radoičić, Jan Kynčl, Géza Tóth

Publication date: 12 May 2015

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.1046

zbMATH Keywords

pseudoline arrangementsimple topological graphsaturated topological graph

Mathematics Subject Classification ID

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

Related Items (6)

Edge-minimum saturated \(k\)-planar drawings ⋮ Extending simple drawings ⋮ On the edge-vertex ratio of maximal thrackles ⋮ Inserting one edge into a simple drawing is hard ⋮ Saturated Simple and 2-simple Topological Graphs with Few Edges ⋮ Quantitative Restrictions on Crossing Patterns

Cites Work

• Unnamed Item
• Improved enumeration of simple topological graphs
• Disjoint edges in topological graphs
• A survey of minimum saturated graphs
• Density theorems for bipartite graphs and related Ramsey-type results
• Unavoidable configurations in complete topological graphs
• Research Problems in Discrete Geometry
• Saturated graphs with minimal number of edges
• Topological graphs
• A Problem in Graph Theory
• Many disjoint edges in topological graphs
• Disjoint edges in complete topological graphs

This page was built for publication: Saturated simple and \(k\)-simple topological graphs