scientific article; zbMATH DE number 881174

MaRDI QIDQ4879104zbMATH OpenFDO

Authors Adrian Riskin

Publication date 8 July 1996

zbMATH Keywords

crossing numberscubic planar 3-connected graphsdrawingplane embeddingspolyhedral map

Mathematics Subject Classification ID

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

Recommendations

• On non-planarity of cubic graphs
• There are no cubic graphs on 26 vertices with crossing number 10 or 11
• On the crossing number of almost planar graphs
• Crossing number is hard for cubic graphs
• Adding one edge to planar graphs makes crossing number hard

Cited in

(15)

• On the Penrose number of cubic diagrams
• Extending simple drawings
• There are no cubic graphs on 26 vertices with crossing number 10 or 11
• Cubicity, degeneracy, and crossing number
• On the crossing number of almost planar graphs
• Crossing and Weighted Crossing Number of Near-Planar Graphs
• Cubic graphs with crossing number two
• scientific article; zbMATH DE number 653275 (Why is no real title available?)
• Minimum Integral Drawings of the Platonic Graphs
• On non-planarity of cubic graphs
• MSOL restricted contractibility to planar graphs
• Approximating the Crossing Number of Toroidal Graphs
• Crossing number and weighted crossing number of near-planar graphs
• Inserting one edge into a simple drawing is hard
• Complexity of anchored crossing number and crossing number of almost planar graphs

This page was built for publication:

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