Triangular imbedding of \(K_n-K_6\)

DOI10.1016/0095-8956(76)90054-XzbMath0352.05026WikidataQ56432141 ScholiaQ56432141MaRDI QIDQ1235709

Richard K. Guy, Gerhard Ringel

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (3)

The nonorientable genus of joins of complete graphs with large edgeless graphs ⋮ Minimal triangulations on orientable surfaces ⋮ Simultaneous current graph constructions for minimum triangulations and complete graph embeddings

Cites Work

• Unnamed Item
• A smooth and unified proof of cases 6, 5 and 3 of the Ringel-Youngs theorem
• Solution of the heawood map-coloring problem—Cases 3, 5, 6, and 9

This page was built for publication: Triangular imbedding of \(K_n-K_6\)