scientific article

zbMath0984.05027MaRDI QIDQ2777504

Celina M. Herrera de Figueiredo, Luérbio Faria

Publication date: 7 March 2002

Full work available at URL: https://eudml.org/doc/32252

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

drawingcrossing numbertopological graph theory

Mathematics Subject Classification ID

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

Related Items (5)

Algorithms for the fixed linear crossing number problem ⋮ The crossing number of locally twisted cubes \(L T Q_n\) ⋮ Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes ⋮ An improved upper bound on the crossing number of the hypercube ⋮ A survey of graphs with known or bounded crossing numbers

Cites Work

• Unnamed Item
• On crossing numbers of hypercubes and cube connected cycles
• The crossing number of \(C_3\times C_n\)
• Crossing Number is NP-Complete
• Crossing Number Problems
• Bounds for the crossing number of the N‐cube

This page was built for publication: