Saturated simple and 2-simple topological graphs with few edges

DOI10.7155/JGAA.00460MaRDI QIDQ4600740zbMATH OpenOpenAlexFDO

Authors Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz

Publication date 12 January 2018

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00460

zbMATH Keywords

pseudoline arrangementsimple topological graphsaturated topological graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Saturated Simple and 2-simple Topological Graphs with Few Edges
• Saturated simple and \(k\)-simple topological graphs
• On edges crossing few other edges in simple topological complete graphs
• Graph Drawing
• Enumeration of simple complete topological graphs

Cited in

(11)

• Edge-minimum saturated \(k\)-planar drawings
• Saturated Simple and 2-simple Topological Graphs with Few Edges
• Edge-minimum saturated \(k\)-planar drawings
• Crossing-optimal extension of simple drawings
• Saturated simple and \(k\)-simple topological graphs
• Inserting one edge into a simple drawing is hard
• Quantitative restrictions on crossing patterns
• Improved enumeration of simple topological graphs
• Separable drawings: extendability and crossing-free Hamiltonian cycles
• Extending simple drawings
• On the edge-vertex ratio of maximal thrackles

This page was built for publication: Saturated simple and 2-simple topological graphs with few edges

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