Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames

DOI10.1016/j.disc.2015.01.035zbMath1309.05111OpenAlexW2048490548MaRDI QIDQ2339434

Aras Erzurumluoğlu, C. A. Rodger

Publication date: 1 April 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.01.035

zbMATH Keywords

framesHamilton cyclesfair edge-colorings

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

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 ⋮ Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• On the existence of cycle frames and almost resolvable cycle systems
• More results on cycle frames and almost resolvable cycle systems
• Hamiltonian decompositions of complete graphs
• Hamiltonian decompositions of complete regular s-partite graphs
• Fair Hamilton decompositions of complete multipartite graphs
• \(C_{4p}\)-frame of complete multipartite multigraphs
• Hamilton cycle rich 2-factorizations of complete multipartite graphs
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• Multiply balanced edge colorings of multigraphs
• Hamilton decompositions of complete multipartite graphs with any 2‐factor leave
• Hamilton cycle rich two-factorizations of complete graphs

This page was built for publication: Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames