scientific article; zbMATH DE number 1792068

MaRDI QIDQ4552009zbMATH OpenFDO

Authors Osamu Nakamura

Publication date 24 February 2003

zbMATH Keywords

algorithmcrossing numberenumeration

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On the crossing number of complete graphs
• On the crossing number of complete graphs
• The Crossing Number of Graphs: Theory and Computation
• On the crossing number of some complete multipartite graphs
• Survey of the crossing number of graphs
• Crossing numbers of graphs
• scientific article; zbMATH DE number 2079388
• On the crossing number of almost planar graphs
• On the Crossing Number of Almost Planar Graphs
• ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS

Cited in

(10)

• Special numbers of crossings for complete graphs
• The number of crossings in multigraphs with no empty lens
• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
• On the Size of Planarly Connected Crossing Graphs
• The crossing number of chordal ring networks
• On the crossing number of some complete multipartite graphs
• scientific article; zbMATH DE number 1792067 (Why is no real title available?)
• scientific article; zbMATH DE number 969978 (Why is no real title available?)
• On the crossing number of complete graphs
• Configurations with few crossings in topological 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 Q4552009)