On bipartite 2-factorizations of kn − I and the Oberwolfach problem
From MaRDI portal
Publication:3174234
DOI10.1002/jgt.20538zbMath1230.05231OpenAlexW2038921999WikidataQ60174490 ScholiaQ60174490MaRDI QIDQ3174234
Peter Danziger, Darryn E. Bryant
Publication date: 12 October 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20538
Related Items (32)
On the Oberwolfach problem for single-flip 2-factors via graceful labelings ⋮ Decompositions of complete graphs into bipartite 2-regular subgraphs ⋮ A cyclic solution for an infinite class of Hamilton-Waterloo problems ⋮ Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles ⋮ Hamilton cycle rich 2-factorization of complete bipartite graphs ⋮ The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles ⋮ On the existence of unparalleled even cycle systems ⋮ Note on three table Oberwolfach problem ⋮ Merging Combinatorial Design and Optimization: the Oberwolfach Problem ⋮ Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles ⋮ A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors ⋮ A complete solution to the two-table Oberwolfach problems ⋮ Hamilton cycle rich 2-factorization of complete equipartite graphs. II ⋮ Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs ⋮ Orthogonally Resolvable Cycle Decompositions ⋮ Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem ⋮ On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles ⋮ Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment ⋮ A complete solution to the infinite Oberwolfach problem ⋮ A constructive solution to the Oberwolfach problem with a large cycle ⋮ 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem ⋮ On the Hamilton-Waterloo problem with cycle lengths of distinct parities ⋮ Zero-sum flows for triple systems ⋮ The Hamilton-Waterloo problem for triangle-factors and heptagon-factors ⋮ Resolution of the Oberwolfach problem ⋮ Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices ⋮ On the generalized Oberwolfach problem ⋮ On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity ⋮ Bipartite 2‐Factorizations of Complete Multipartite Graphs ⋮ The Hamilton-Waterloo problem with even cycle lengths ⋮ Unnamed Item ⋮ The structure of 2-pyramidal 2-factorizations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Hamilton cycle decomposition of 6-regular circulant graphs
- Complete solutions to the Oberwolfach problem for an infinite set of orders
- Hamiltonian decomposition of Cayley graphs of degree 4
- On a variation of the Oberwolfach problem
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- On the Hamilton-Waterloo problem
- Two-factorizations of small complete graphs
- The Oberwolfach problem and factors of uniform odd length cycles
- The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
- On sharply vertex transitive 2-factorizations of the complete graph
- Some cyclic solutions to the three table Oberwolfach problem
- SOME RESULTS ON THE OBERWOLFACH PROBLEM
- The Hamilton-Waterloo problem for cycle sizes 3 and 4
- The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
- Some observations on the oberwolfach problem
- On the Oberwolfach problem with two similar length cycles
This page was built for publication: On bipartite 2-factorizations of kn − I and the Oberwolfach problem
