Decomposition of the complete directed graph into k-circuits
From MaRDI portal
Publication:1232420
DOI10.1016/0095-8956(76)90055-1zbMath0344.05123OpenAlexW2019265612MaRDI QIDQ1232420
Vance Faber, Jean-Claude Bermond
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-02366539/file/11-BeFa76-Kn%2A%20en%20kcircuits.pdf
Related Items (27)
Packings and coverings of the complete directed multigraph with 3- and 4-circuits ⋮ Optimal packing of even circuits into a \(\text{DK}_ v\) ⋮ On the genus of joins and compositions of graphs ⋮ Hamiltonian decomposition of complete regular multipartite digraphs ⋮ Optimality of neighbour balanced designs ⋮ Designs balanced for neighbor effects in circular blocks of size six ⋮ Hamiltonian decomposition of lexicographic products of digraphs ⋮ A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\) ⋮ Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles ⋮ Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k ⋮ Edge partitions of the complete symmetric directed graph and related designs ⋮ On covers of graphs ⋮ Construction of Hamilton path tournament designs ⋮ On Hering decomposition of DK\(_n\) induced by group actions on conjugacy classes ⋮ A class of self-orthogonal 2-sequencings ⋮ Hamiltonian decomposition of \(K^*_ n\), patterns with distinct differences, and Tuscan squares ⋮ Balanced directed cycle designs based on groups ⋮ Self-orthogonal Hamilton path decompositions ⋮ Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length ⋮ Construction of neighbor designs of block size 4 for all values of v ≥ 5 by using the method of addition ⋮ Resolvable and near-resolvable decompositions of \(DK_ v\) into oriented 4-cycles ⋮ Decomposition of \(K_n\) into circuits of odd length ⋮ A construction for equidistant permutation arrays of index one ⋮ Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph ⋮ Six-cycle systems ⋮ Construction of Neighbor-Balanced Designs in Linear Blocks ⋮ Packings of the complete directed graph with \(m\)-circuits
Cites Work
- Sequences in groups with distinct partial products
- An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- On the cyclic decompositions of the complete graph into polygons with odd number of edges
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Decomposition of the complete directed graph into k-circuits
