Back to Search
Start Over
Hamilton path decompositions of complete multipartite graphs.
- Source :
-
Journal of Combinatorial Theory - Series B . Mar2019, Vol. 135, p1-15. 15p. - Publication Year :
- 2019
-
Abstract
- Abstract We prove that a complete multipartite graph K with n > 1 vertices and m edges can be decomposed into edge-disjoint Hamilton paths if and only if m n − 1 is an integer and the maximum degree of K is at most 2 m n − 1. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00958956
- Volume :
- 135
- Database :
- Academic Search Index
- Journal :
- Journal of Combinatorial Theory - Series B
- Publication Type :
- Academic Journal
- Accession number :
- 133826653
- Full Text :
- https://doi.org/10.1016/j.jctb.2018.07.006