Orthogonally resolvable cycle decompositions

DOI10.1002/JCD.21404zbMATH Open1322.05112OpenAlexW2112800816MaRDI QIDQ2950653FDOQ2950653

Authors: Peter Danziger, Eric Mendelsohn, Brett Stevens, Andrea Burgess 

Publication date: 9 October 2015

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21404

Recommendations

• Orthogonal \(H\)-decompositions.
• scientific article; zbMATH DE number 7593862
• Orthogonal double covers by super-extendable cycles
• scientific article; zbMATH DE number 638683
• Resolvable even cycle decompositions of the tensor product of complete graphs

zbMATH Keywords

cycle system2-factorizationsKirkman squaresorthogonal factorizationsdoubly resovable

Mathematics Subject Classification ID

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

Cites Work

• Combinatorial Designs
• The CRC handbook of combinatorial designs
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• Title not available (Why is that?)
• A complete solution to the two-table Oberwolfach problems
• The equipartite Oberwolfach problem with uniform tables
• On sharply vertex transitive 2-factorizations of the complete graph
• Title not available (Why is that?)
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• The existence of orthogonal resolutions of lines in AG(n,q)
• Doubly resolvable designs from generalized Bhaskar Rao designs
• Doubly resolvable designs
• On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays
• Transversal designs and doubly-resolvable designs
• The existence of Room squares
• The existence of Kirkman squares -- doubly resolvable \((v,3,1)\)-BIBDs
• The existence of doubly resolvable \((v,3,2)\)-BIBDs
• A few more Kirkman squares and doubly near resolvable BIBDs with block size 3
• Doubly resolvable nearly Kirkman triple systems
• Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Mutually Orthogonal Resolutions and Near-Resolutions
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The Oberwolfach problem and factors of uniform odd length cycles
• Some cyclic solutions to the three table Oberwolfach problem
• SOME RESULTS ON THE OBERWOLFACH PROBLEM
• Title not available (Why is that?)
• 2-starters, graceful labelings, and a doubling construction for the Oberwolfach problem
• On the Oberwolfach problem with two similar length cycles
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Title not available (Why is that?)
• From graceful labellings of paths to cyclic solutions of the Oberwolfach problem
• Some observations on the oberwolfach problem
• Title not available (Why is that?)
• Hamiltonian decomposition of lexicographic product
• Orthogonal line packings of \(PG_{2m-1}(2)\)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Doubly resolvable 4-cycle systems of \(2K_v\)
• Mutually orthogonal cycle systems
• On generalized Howell designs with block size three
• Orthogonal cycle systems with cycle length less than 10
• Title not available (Why is that?)
• Orthogonally resolvable matching designs

Uses Software

• OEIS

This page was built for publication: Orthogonally resolvable cycle decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2950653)