Do we really understand the crossing numbers?

DOI10.1007/978-3-642-15155-2_5MaRDI QIDQ3586069zbMATH OpenOpenAlexFDO

Authors Bojan Mohar

Publication date 3 September 2010

Published in Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15155-2_5

Mathematics Subject Classification ID

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

Recommendations

• Crossing numbers
• SOFSEM 2005: Theory and Practice of Computer Science
• The graph crossing number and its variants: a survey
• Crossing numbers of graphs
• The Crossing Number of Graphs: Theory and Computation

Cited in

(15)

• The graph crossing number and its variants: a survey
• Graphs with at most one crossing
• Crossing numbers of periodic graphs
• Expected crossing numbers
• The Crossing Number of C_m × C_n: A Reluctant Induction
• On the crossing number of honeycomb related networks
• An optimality criterion for the crossing number
• The Orchard crossing number of an abstract graph
• Crossing numbers
• Crossing numbers of graphs
• scientific article; zbMATH DE number 2170413 (Why is no real title available?)
• scientific article; zbMATH DE number 867657 (Why is no real title available?)
• SOFSEM 2005: Theory and Practice of Computer Science
• Crossing numbers of Sierpiński‐like graphs
• From art and circuit design to geometry and combinatorics

This page was built for publication: Do we really understand the crossing numbers?

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