Back to Search
Start Over
Hamilton Decomposable Graphs with Specified Leaves.
- Source :
- Graphs & Combinatorics; Nov2004, Vol. 20 Issue 4, p541-543, 3p
- Publication Year :
- 2004
-
Abstract
- In this paper, a simple proof is given of a result that provides necessary and sufficient conditions for the existence of a hamilton decomposition ofG-E(H) for any non-bipartiter-regular complete multipartite graphGand for any 2-factorHofG. Such conditions were originally obtained by Buchanan for complete graphs (ie whenr=|V(G)|-1), and in some cases by Leach and Rodger otherwise (Leach and Rodger also settled the bipartite case). This result is extended to consider hamilton decompositions ofG-E(H?F), whereFis a 1-factor ofG. [ABSTRACT FROM AUTHOR]
- Subjects :
- GRAPH theory
MATHEMATICAL decomposition
MATHEMATICS
ALGEBRA
COMBINATORICS
TOPOLOGY
Subjects
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 20
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 15204678
- Full Text :
- https://doi.org/10.1007/s00373-004-0573-0