On book crossing numbers of the complete graph

DOI10.1137/20m138260xzbMATH Open1540.05125MaRDI QIDQ6552472

Julia Kinzel, Yakov Sapozhnikov, Bernardo M. Ábrego, Evgeniya Lagoda, Silvia Fernández-Merchant

Publication date: 8 June 2024

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

zbMATH Keywords

crossing numbercomplete graphconvex geometric graphbook crossing numberlocal crossing numberbook drawings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Erd?s problems and related topics of discrete geometry (52C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Outer 1-planar graphs
• Improving the crossing lemma by finding more crossings in sparse graphs
• Graphs drawn with few crossings per edge
• The graph crossing number and its variants: a survey
• On topological graphs with at most four crossings per edge
• The 2-page crossing number of \(K_{n}\)
• Ein Sechsfarbenproblem auf der Kugel
• Improved Lower Bounds on Book Crossing Numbers of Complete Graphs
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• Crossing Numbers of Graphs
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability
• The book crossing number of a graph

This page was built for publication: On book crossing numbers of the complete graph