An infinite family of octahedral crossing numbers

DOI10.1002/jgt.3190020211zbMath0406.05029OpenAlexW2019496217MaRDI QIDQ4192085

Jonathan L. Gross

Publication date: 1978

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190020211

Mathematics Subject Classification ID

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

Related Items (4)

Drawings of graphs on surfaces with few crossings ⋮ Improved bounds for the crossing numbers on surfaces of genus g ⋮ Self-dual embeddings of Cayley graphs ⋮ A new family of skewed slash distributions generated by the normal kernel

Cites Work

• Quotients of complete graphs: revisiting the Heawood map-coloring problem
• Self-dual orientable embedding of \(K_n\)
• A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
• On the Genus of Strong Tensor Products of Graphs

This page was built for publication: An infinite family of octahedral crossing numbers