Fair Hamilton decompositions of complete multipartite graphs
From MaRDI portal
Publication:1850614
DOI10.1006/jctb.2001.2104zbMath1024.05072OpenAlexW2070602317MaRDI QIDQ1850614
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2001.2104
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items
Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs ⋮ Internally fair factorizations and internally fair holey factorizations with prescribed regularity ⋮ Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\) ⋮ Amalgamations and Equitable Block-Colorings ⋮ On evenly-equitable, balanced edge-colorings and related notions ⋮ Unnamed Item ⋮ Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames
Cites Work
- Unnamed Item
- Hamiltonian decompositions of complete graphs
- Hamiltonian decompositions of complete regular s-partite graphs
- Amalgamations of almost regular edge-colourings of simple graphs
- The embedding of partial triple systems when 4 divides \(\lambda\)
- A sufficient condition for equitable edge-colourings of simple graphs
- Balanced Gray codes
- Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
- The Solution of a Timetabling Problem