The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of then-Cube

DOI10.1002/jgt.21910zbMath1346.05041OpenAlexW2166241301WikidataQ114236169 ScholiaQ114236169MaRDI QIDQ2825477

Imrich Vrt'o, Luérbio Faria, R. Bruce Richter, Celina M. Herrera de Figueiredo

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

rectilinear crossing number\(n\)-cubetopological graph theory2-page crossing number

Mathematics Subject Classification ID

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

Related Items (1)

Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth

Cites Work

• Embedding planar graphs in four pages
• The 2-page crossing number of \(K_{n}\)
• \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\)
• Improved Lower Bounds for the 2-Page Crossing Numbers of $K_{m,n}$ and $K_n$ via Semidefinite Programming
• Crossing Number is NP-Complete
• An improved upper bound on the crossing number of the hypercube
• The crossing number of c₄ × c₄
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Crossing Number Problems
• Bounds for the crossing number 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 then-Cube