Decomposition of complete graphs into small graphs
In 1967, A. Rosa proved that if a bipartite graph \(G\) with \(n\) edges has an \(\alpha\)-labeling, then for any positive integer \(p\) the complete graph \(K_{2np+1}\) can be cyclically decomposed into copies of \(G\). This has become a part of graph theory folklore since then. In this note we pro...
Main Author: | Dalibor Froncek |
---|---|
Format: | Article |
Language: | English |
Published: |
AGH Univeristy of Science and Technology Press
2010-01-01
|
Series: | Opuscula Mathematica |
Subjects: | |
Online Access: | http://www.opuscula.agh.edu.pl/vol30/3/art/opuscula_math_3021.pdf |
Similar Items
-
Decomposition of complete graphs into connected unicyclic graphs with eight edges and pentagon
by: Dalibor Froncek, et al.
Published: (2019-06-01) -
Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges
by: John Fahnenstiel, et al.
Published: (2019-10-01) -
α_{2}-labeling of graphs
by: Dalibor Fronček
Published: (2009-01-01) -
Decomposition of Certain Complete Bipartite Graphs into Prisms
by: Froncek Dalibor
Published: (2017-02-01) -
On 1-rotational decompositions of complete graphs into tripartite graphs
by: Ryan C. Bunge
Published: (2019-01-01)