The same upper bound for both: the 2-page and the rectilinear crossing numbers of the n-cube

DOI10.1007/978-3-642-45043-3_22MaRDI QIDQ2864306zbMATH OpenOpenAlexFDO

Authors Imrich Vrt'o, Luerbio Faria, Celina M. H. de Figueiredo, R. B. Richter

Publication date 6 December 2013

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45043-3_22

zbMATH Keywords

\(n\)-cubetopological graph theoryrectilinear crossing numbertwo-page crossing number

Mathematics Subject Classification ID

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

Recommendations

• The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube
• The maximum rectilinear crossing number of the \(n\) dimensional cube graph
• An improved upper bound on the crossing number of the hypercube
• Bounds for the crossing number of the N‐cube
• An improved upper bound on the crossing number of the hypercube.

Cited in

(3)

• New bounds on the biplanar crossing number of low-dimensional hypercubes: how low can you go?
• The maximum rectilinear crossing number of the \(n\) dimensional cube graph
• The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube

This page was built for publication: The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube

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