Maximal sets of hamilton cycles in complete multipartite graphs
From MaRDI portal
Publication:4808406
DOI10.1002/jgt.10096zbMath1028.05058OpenAlexW4252249774MaRDI QIDQ4808406
J. A. MacDougall, Mike Daven, C. A. Rodger
Publication date: 22 May 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10096
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (4)
Maximal sets of Hamilton cycles in complete multipartite graphs. IV ⋮ Maximal sets of Hamilton cycles in \(K_{2p}-F\) ⋮ Maximal sets of Hamilton cycles in \(D_n\) ⋮ Maximal sets of Hamilton cycles in \(K \left( n^r ; \lambda_1 , \lambda_2\right)\)
This page was built for publication: Maximal sets of hamilton cycles in complete multipartite graphs