Hamilton decompositions of complete multipartite graphs with any 2‐factor leave
From MaRDI portal
Publication:4446893
DOI10.1002/jgt.10142zbMath1031.05108MaRDI QIDQ4446893
Publication date: 3 February 2004
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10142
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences, Amalgamations and Equitable Block-Colorings, Hamilton decompositions of complete graphs with a 3-factor leave., Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\), Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames, Recent advances on the Hamiltonian problem: survey III, Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs, Multiply balanced edge colorings of multigraphs, Detachments of Hypergraphs I: The Berge–Johnson Problem