Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Hao Chuien Hang"'
Publikováno v:
Journal of Combinatorial Theory, Series B. 135:1-15
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 .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4999b853d2303676d39c8c4b1530cc8
https://doi.org/10.1016/j.jctb.2018.07.006
https://doi.org/10.1016/j.jctb.2018.07.006
