An improved upper bound on the crossing number of the hypercube
From MaRDI portal
Publication:3605145
DOI10.1002/JGT.20330zbMATH Open1161.05025OpenAlexW2460176013MaRDI QIDQ3605145FDOQ3605145
Luerbio Faria, Celina Miraglia Herrera de Figueiredo, Ondrej Sýkora, Imrich Vrt'o
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
Recommendations
- An improved upper bound on the crossing number of the hypercube.
- 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 maximum rectilinear crossing number of the \(n\) dimensional cube graph
- On Eggleton and Guy's conjectured upper bound for the crossing number of the \(n\)-cube
Cites Work
Cited In (17)
- Bounds for the crossing number of the N‐cube
- Drawing a graph in a hypercube
- A new upper bound on the queuenumber of hypercubes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved upper bounds for Random-Edge and Random-Jump on abstract cubes
- Improved upper bounds on the crossing number
- Title not available (Why is that?)
- On Eggleton and Guy's conjectured upper bound 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 locally twisted cubes \(L T Q_n\)
- The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube
- On crossing numbers of hypercubes and cube connected cycles
- On the central levels problem
- An upper bound for the crossing number of augmented cubes
- 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
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 Q3605145)
