An improved upper bound on the crossing number of the hypercube.

DOI10.1007/B93953MaRDI QIDQ5902524zbMATH OpenFDO

Authors

Publication date 12 January 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B93953

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An improved upper bound on the crossing number of the hypercube
• The maximum rectilinear crossing number of the n dimensional cube graph
• Bounds for the crossing number of the N‐cube
• Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes
• The crossing number of folded hypercubes

Cited in

(16)

• Drawing a graph in a hypercube
• On Eggleton and Guy's conjectured upper bound for the crossing number of the n-cube
• The crossing number of folded hypercubes
• The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube
• The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube
• Improved upper bounds on the crossing number
• An improved upper bound on the crossing number of the hypercube
• scientific article; zbMATH DE number 1741018 (Why is no real title available?)
• scientific article; zbMATH DE number 219248 (Why is no real title available?)
• New bounds on the biplanar crossing number of low-dimensional hypercubes: how low can you go?
• Improved bounds on the crossing number of butterfly network
• Bounds for the crossing number of the N‐cube
• Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes
• Bound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxation
• On crossing numbers of hypercubes and cube connected cycles
• A new upper bound on the queuenumber of hypercubes

This page was built for publication: An improved upper bound on the crossing number of the hypercube.

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