Bipartite 2‐Factorizations of Complete Multipartite Graphs

DOI10.1002/jgt.21806zbMath1309.05145OpenAlexW1601784190WikidataQ114236173 ScholiaQ114236173MaRDI QIDQ4982289

Peter Danziger, William Pettersson, Darryn E. Bryant

Publication date: 24 March 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://espace.library.uq.edu.au/view/UQ:351757/UQ351757_OA.pdf

zbMATH Keywords

graph decompositionOberwolfach problemgraph factorisation

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

A cyclic solution for an infinite class of Hamilton-Waterloo problems ⋮ Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment ⋮ On the Hamilton-Waterloo problem with cycle lengths of distinct parities ⋮ Cyclic uniform 2-factorizations of the complete multipartite graph ⋮ 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 ⋮ Unnamed Item

Cites Work

• 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
• The solution of the bipartite analogue of the Oberwolfach problem
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• The Oberwolfach problem and factors of uniform odd length cycles
• The equipartite Oberwolfach problem with uniform tables
• On bipartite 2-factorizations of kn − I and the Oberwolfach problem
• On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors

This page was built for publication: Bipartite 2‐Factorizations of Complete Multipartite Graphs