Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs

It is shown that if $G$ is any bipartite 2-regular graph of order at most $n/2$ or at least $n-2$, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order $n$ into a perfect matching and edge-disjoint copies of $G$.

Saved in:
Bibliographic Details
Published in:The Electronic journal of combinatorics 2016-04, Vol.23 (2)
Main Authors: Bryant, Darryn, Burgess, Andrea, Danziger, Peter
Format: Article
Language:English
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is shown that if $G$ is any bipartite 2-regular graph of order at most $n/2$ or at least $n-2$, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order $n$ into a perfect matching and edge-disjoint copies of $G$.
ISSN:1077-8926
1077-8926
DOI:10.37236/4634