Improved upper bounds on the crossing number

DOI10.1145/1377676.1377739zbMATH Open1271.05027OpenAlexW2126719142MaRDI QIDQ3602937FDOQ3602937

Authors: Vida Dujmović, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood 

Publication date: 12 February 2009

Published in: Proceedings of the twenty-fourth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1377676.1377739

Recommendations

• An improvement of the crossing number bound
• scientific article; zbMATH DE number 2084269
• New bounds on crossing numbers
• An improved upper bound on the crossing number of the hypercube
• Improved Bounds for the Crossing Numbers of Km,n and Kn
• A better bound for the pair-crossing number
• An improved upper bound on the crossing number of the hypercube.
• Improvement on the Decay of Crossing Numbers
• Improvement on the decay of crossing numbers
• Improvement on the crossing number of crossing-critical graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)

Cited In (17)

• Planar decompositions and the crossing number of graphs with an excluded minor
• New upper bounds for the crossing numbers of crossing-critical graphs
• New results on rectilinear crossing numbers and plane embeddings
• Upper bounds for ropelength as a function of crossing number.
• The effect of planarization on width
• Title not available (Why is that?)
• General lower bounds for the minor crossing number of graphs
• Title not available (Why is that?)
• On crossing numbers of geometric proximity graphs
• Crossing Numbers and Cutwidths
• Bounds for Convex Crossing Numbers
• On the Maximum Crossing Number
• Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree
• A Golden Ratio Inequality for Vertex Degrees of Graphs
• Tight Upper Bounds on the Crossing Number in a Minor-Closed Class
• The Minor Crossing Number
• Title not available (Why is that?)

This page was built for publication: Improved upper bounds on the crossing number

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