Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\)
From MaRDI portal
Publication:1685980
DOI10.1016/j.disc.2017.08.043zbMath1376.05079OpenAlexW2758605595MaRDI QIDQ1685980
Aras Erzurumluoğlu, C. A. Rodger
Publication date: 20 December 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.08.043
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Hamiltonian decompositions of complete graphs
- Hamiltonian decompositions of complete regular s-partite graphs
- Constructing day-balanced round-robin tournaments with partitions
- Fair Hamilton decompositions of complete multipartite graphs
- Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames
- Internally fair factorizations and internally fair holey factorizations with prescribed regularity
- Hamilton cycle rich 2-factorizations of complete multipartite graphs
- Fair 1-factorizations and fair holey 1-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
