The Coarseness of the Complete Graph
From MaRDI portal
Publication:5542640
DOI10.4153/CJM-1968-085-6zbMath0159.25402MaRDI QIDQ5542640
Richard K. Guy, Lowell W. Beineke
Publication date: 1968
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items (12)
A survey on the existence ofG-Designs ⋮ Designs for graphs with six vertices and ten edges -- II ⋮ Decomposition of Complete Graphs into Isomorphic Complete Bipartite Graphs ⋮ Graph theory ⋮ The spectrum problem for the connected cubic graphs of order 10 ⋮ Some problems in topological graph theory ⋮ Non-planar core reduction of graphs ⋮ A complete solution to the spectrum problem for graphs with six vertices and up to nine edges ⋮ Unnamed Item ⋮ Graphs with forbidden subgraphs ⋮ On the existence of balanced bipartite designs. II ⋮ Designs for graphs with six vertices and ten edges
This page was built for publication: The Coarseness of the Complete Graph
