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

DOI10.1002/JGT.21910MaRDI QIDQ2825477zbMATH OpenOpenAlexWikidataFDO

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

Publication date 13 October 2016

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

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

zbMATH Keywords

\(n\)-cubetopological graph theory2-page crossing numberrectilinear 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.

Cites work

• An improved upper bound on the crossing number of the hypercube
• Bounds for the crossing number of the N‐cube
• Crossing Number Problems
• Crossing Number is NP-Complete
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Embedding planar graphs in four pages
• Improved lower bounds for the 2-page crossing numbers of \(K_{m,n}\) and \(K_n\) via semidefinite programming
• The 2-page crossing number of \(K_{n}\)
• The crossing number of c₄ × c₄
• \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\)

Cited in

(4)

• Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
• On Eggleton and Guy's conjectured upper bound for the crossing number of the \(n\)-cube
• 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 Q2825477)