Decompositions of complete graphs into bipartite 2-regular subgraphs

zbMath1335.05136MaRDI QIDQ281575

Darryn E. Bryant, Peter Danziger, Andrea C. Burgess

Publication date: 11 May 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p1

zbMATH Keywords

graph decompositions

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete solution to the two-table Oberwolfach problems
• Trails of triples in partial triple systems
• Packing paths in complete graphs
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions III: Complete graphs and fixed length cycles
• A Graph Partition Problem
• On bipartite 2-factorizations of kn − I and the Oberwolfach problem
• A survey on the existence ofG-Designs
• Edge-decompositions of graphs with high minimum degree

This page was built for publication: Decompositions of complete graphs into bipartite 2-regular subgraphs