The Coarseness of the Complete Graph

DOI10.4153/CJM-1968-085-6MaRDI QIDQ5542640zbMATH OpenFDO

Authors Richard K. Guy, L. W. Beineke

Publication date 1968

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1968-085-6

zbMATH Keywords

topology

Cited in

(13)

• Decomposition of complete graphs into isomorphic complete bipartite graphs
• Graphs with forbidden subgraphs
• Non-planar core reduction of graphs
• Some problems in topological graph theory
• Designs for graphs with six vertices and ten edges
• Designs for graphs with six vertices and ten edges -- II
• scientific article; zbMATH DE number 6857389 (Why is no real title available?)
• Decomposing complete graphs into isomorphic complete multipartite graphs
• The spectrum problem for the connected cubic graphs of order 10
• Graph theory
• On the existence of balanced bipartite designs. II
• A complete solution to the spectrum problem for graphs with six vertices and up to nine edges
• A survey on the existence ofG-Designs

This page was built for publication: The Coarseness of the Complete Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5542640)