Cycle systems in the complete bipartite graph minus a one-factor
From MaRDI portal
Publication:1876671
DOI10.1016/j.disc.2003.11.021zbMath1049.05020OpenAlexW1994453579WikidataQ55891584 ScholiaQ55891584MaRDI QIDQ1876671
Marisa Debowsky, Jeffrey H. Dinitz, Dan S. Archdeacon, Heather Jordon
Publication date: 20 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.021
Related Items (9)
Decomposition of complete bipartite graphs into cycles of distinct even lengths ⋮ Packings and Coverings of the Complete Bipartite Graph by Octagons ⋮ A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ Decomposing various graphs into short even-length cycles ⋮ \( \mathcal{P} \)-energy of graphs ⋮ Large sets of Hamilton cycle decompositions of complete bipartite graphs ⋮ Monochromatic \(k\)-edge-connection colorings of graphs ⋮ Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach ⋮ Six-cycle systems
Cites Work
- Hamiltonian decompositions of complete regular s-partite graphs
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Decompositions of complete multipartite graphs into cycles of even length
- Cycle decompositions III: Complete graphs and fixed length cycles
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Cycle systems in the complete bipartite graph minus a one-factor
