The splitting number of the complete graph

DOI10.1007/BF02582960zbMath0617.05027MaRDI QIDQ1821790

Gerhard Ringel, Nora Hartsfield, Brad Jackson

Publication date: 1985

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

embeddingcomplete graphvertex splitting

Mathematics Subject Classification ID

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

Related Items (11)

The toroidal splitting number of the complete graph \(K_ n\) ⋮ The splitting number of the complete graph in the projective plane ⋮ Splitting plane graphs to outerplanarity ⋮ Planarizing graphs and their drawings by vertex splitting ⋮ Efficient generation of different topological representations of graphs beyond-planarity ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Research problems ⋮ On the planar split thickness of graphs ⋮ SPLITTING NUMBER is NP-complete ⋮ Heawood's empire problem

Cites Work

• Solution of Heawood's empire problem in the plane.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The splitting number of the complete graph