Bishellable drawings of $K_n$

DOI10.1137/17M1147974zbMath1400.05061arXiv1510.00549OpenAlexW2963357992MaRDI QIDQ4555043

Petra Mutzel, Bojan Mohar, Birgit Vogtenhuber, Oswin Aichholzer, Pedro A. Ramos, Silvia Fernández-Merchant, Bernardo M. Ábrego, R. Bruce Richter, Daniel McQuillan

Publication date: 19 November 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

crossing numbercomplete graphshellabilitygood drawingbishellabilitysimple drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Bounding the tripartite‐circle crossing number of complete tripartite graphs, Unnamed Item, On plane subgraphs of complete topological drawings, Extending Drawings of Complete Graphs into Arrangements of Pseudocircles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)
• The 2-page crossing number of \(K_{n}\)
• The early history of the brick factory problem
• Shellable drawings and the cylindrical crossing number of \(K_n\)
• A lower bound for the rectilinear crossing number
• On the Crossing Number of Kn without Computer Assistance
• The crossing number of K₁₁ is 100
• On the Number of Crossings in a Complete Graph