On book crossing numbers of the complete graph

DOI10.1137/20M138260XMaRDI QIDQ6552472zbMATH OpenFDO

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

Publication date 8 June 2024

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

Full work available at URL https://doi.org/10.1137/20M138260X

zbMATH Keywords

book crossing numberbook drawingscomplete graphconvex geometric graphcrossing numberlocal crossing number

Mathematics Subject Classification ID

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

Recommendations

• Improved lower bounds on book crossing numbers of complete graphs
• Book drawings of complete bipartite graphs
• On the crossing number of 2-page book drawings of K_n with prescribed number of edges in each page
• The book crossing number of a graph
• scientific article; zbMATH DE number 969978

Cites work

• Crossing numbers of graphs
• Ein Sechsfarbenproblem auf der Kugel
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Graphs drawn with few crossings per edge
• scientific article; zbMATH DE number 3924797 (Why is no real title available?)
• scientific article; zbMATH DE number 15256 (Why is no real title available?)
• scientific article; zbMATH DE number 2145245 (Why is no real title available?)
• scientific article; zbMATH DE number 3258070 (Why is no real title available?)
• scientific article; zbMATH DE number 969978 (Why is no real title available?)
• scientific article; zbMATH DE number 2209719 (Why is no real title available?)
• Improved lower bounds on book crossing numbers of complete graphs
• Improving the crossing lemma by finding more crossings in sparse graphs
• On topological graphs with at most four crossings per edge
• Outer 1-planar graphs
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• The 2-page crossing number of \(K_{n}\)
• The book crossing number of a graph
• The graph crossing number and its variants: a survey
• The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability

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

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