Hamilton decompositions of complete graphs with a 3-factor leave.
From MaRDI portal
Publication:1428535
DOI10.1016/S0012-365X(03)00281-4zbMath1044.05058MaRDI QIDQ1428535
Publication date: 29 March 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
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, Total-colorings of complete multipartite graphs using amalgamations, The total chromatic number of complete multipartite graphs with low deficiency, Hamilton decompositions of balanced complete multipartite graphs with primitive leaves, Hamilton decompositions of graphs with primitive complements, Recent advances on the Hamiltonian problem: survey III, Multiply balanced edge colorings of multigraphs, Detachments of Hypergraphs I: The Berge–Johnson Problem
Cites Work
- Unnamed Item
- Hamiltonian decompositions of complete graphs
- Hamiltonian decompositions of complete regular s-partite graphs
- Hamiltonian decomposition of Cayley graphs of degree 4
- Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
- Hamilton decompositions of complete multipartite graphs with any 2‐factor leave
- The Solution of a Timetabling Problem