An improved upper bound on the crossing number of the hypercube

DOI10.1002/jgt.20330zbMath1161.05025OpenAlexW2460176013MaRDI QIDQ3605145

Celina Miraglia Herrera de Figueiredo, Ondrej Sýkora, Imrich Vrt'o, Luérbio Faria

Publication date: 20 February 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20330

zbMATH Keywords

crossing number\(n\)-cubetopological graph theory

Mathematics Subject Classification ID

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

Related Items

The crossing number of locally twisted cubes \(L T Q_n\), Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes, On the central levels problem, Bound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxation, A survey of graphs with known or bounded crossing numbers, The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of then-Cube, Unnamed Item, An upper bound for the crossing number of augmented cubes

Cites Work

• Planarizing Graphs - A Survey and Annotated Bibliography
• Crossing Number is NP-Complete
• Bounds for the crossing number of the N‐cube
• Unnamed Item
• Unnamed Item
• Unnamed Item