On crossing numbers of hypercubes and cube connected cycles

DOI10.1007/BF01989746zbMath0780.68002OpenAlexW2024534209MaRDI QIDQ688627

Ondrej Sýkora, Imrich Vrt'o

Publication date: 28 November 1993

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

hypercubelower boundcrossing numberscube connected cycles

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Related Items (11)

Algorithms for the fixed linear crossing number problem ⋮ The crossing number of locally twisted cubes \(L T Q_n\) ⋮ Drawings of graphs on surfaces with few crossings ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ Unnamed Item ⋮ Book embeddings and crossing numbers ⋮ Improved bounds for the crossing numbers on surfaces of genus g ⋮ 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 ⋮ An upper bound for the crossing number of augmented cubes ⋮ Matching preclusion for cube-connected cycles

Cites Work

• Unnamed Item
• A survey of the theory of hypercube graphs
• A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
• The crossing number of K5,n
• Crossing Number Problems
• Bounds for the crossing number of the N‐cube

This page was built for publication: On crossing numbers of hypercubes and cube connected cycles