Orthogonally resolvable cycle decompositions

DOI10.1002/JCD.21404MaRDI QIDQ2950653zbMATH OpenOpenAlexFDO

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

cycle system 2-factorizations Kirkman squares orthogonal factorizations doubly resovable

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

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

Cites work

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

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
scientific article; zbMATH DE number 7593862 (Why is no real title available?)
Orthogonally resolvable matching designs

Describes a project that uses

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)