Hamiltonian decompositions of complete graphs
From MaRDI portal
The paper presents a procedure for constructing all Hamiltonian decompositions of the complete graph \(K_{2n+1}\). The technique is then applied to find a necessary and sufficient condition for a decomposition of the edge set of \(K_ r\) (\(r\leq 2n)\) into n classes, each class consisting of disjoint paths to be extendible to a Hamiltonian decomposition of \(K_{2n+1}\) so that each of the classes forms part of a Hamilton cycle.
Recommendations
- Hamiltonian decompositions of complete regular s-partite graphs
- Pairwise compatible Hamilton decompositions of K_n
- Decompositions of complete graphs into triangles and Hamilton cycles
- Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
- Hamilton decomposition of complete 3-uniform hypergraphs
Cites work
- Generalized latin rectangles I: Construction and decomposition
- Generalized latin rectangles. II: Embedding
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3491001 (Why is no real title available?)
- scientific article; zbMATH DE number 3625403 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3353065 (Why is no real title available?)
- scientific article; zbMATH DE number 3394154 (Why is no real title available?)
- Match-Tables
- On A Particular Conference Scheduling Problem
- School Timetables
- The reconstruction of latin squares with applications to school timetabling and to experimental design
- Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares
Cited in
(61)- Hamilton decompositions of graphs with primitive complements
- Hamiltonian decompositions of complete regular s-partite graphs
- Amalgamations of almost regular edge-colourings of simple graphs
- On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs
- Outline symmetric Latin squares
- Pairwise compatible Hamilton decompositions of K_n
- On Hamilton cycle decompositions of the tensor product of complete graphs
- Amalgamations of connected \(k\)-factorizations.
- Hamiltonian double Latin squares
- Hamilton decompositions of complete graphs with a 3-factor leave.
- Fractional latin squares, simplex algebras, and generalized quotients
- Computing complete graph isomorphisms and Hamiltonian cycles from partial ones
- Constructing day-balanced round-robin tournaments with partitions
- Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\)
- Amalgamating infinite Latin squares
- \(G\)-designs and related designs
- Fair Hamilton decompositions of complete multipartite graphs
- Amalgamations of factorizations of complete equipartite graphs
- Embedding connected factorizations
- On the multicolor size Ramsey number of stars and cliques
- Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
- Hamilton decompositions of one-ended Cayley graphs
- Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
- Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames
- Factorizations of complete multipartite hypergraphs
- On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Constructions via Hamiltonian theorems
- Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs
- Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach
- Multiply balanced edge colorings of multigraphs
- Detachments of hypergraphs I: The Berge-Johnson problem
- The wonderful Walecki construction
- Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\)
- Almost regular edge colorings and regular decompositions of complete graphs
- Connected Baranyai's theorem
- Amalgamated Factorizations of Complete Graphs
- Detachments of amalgamated 3-uniform hypergraphs: factorization consequences
- Embedding factorizations for 3-uniform hypergraphs
- Maximal sets of Hamilton cycles inKn,n
- An approximate version of Jackson's conjecture
- Decomposition of product graphs into sunlet graphs of order eight
- Amalgamations and equitable block-colorings
- scientific article; zbMATH DE number 2210802 (Why is no real title available?)
- A note on Hamiltonian decomposition of bubble-sort graphs
- Decomposition of cartesian product of complete graphs into sunlet graphs of order eight
- TSP tour domination and Hamilton cycle decompositions of regular digraphs
- A method of finding edge disjoint Hamiltonian circuits of complete graphs of even order
- Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs
- A constructive solution to the Oberwolfach problem with a large cycle
- On Hamiltonian decompositions of complete 3-uniform hypergraphs
- A survey on constructive methods for the Oberwolfach problem and its variants
- Decomposition of the Johnson graphs into graph-pairs of order 4
- A conjecture on rainbow Hamiltonian cycle decomposition
- Embedding connected factorizations. II
- Hamilton decomposable graphs with specified leaves
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Regular bipartite decompositions of pseudorandom graphs
- On the intricacy of combinatorial construction problems
- Amalgamations of factorizations of complete graphs
- Nomadic decompositions of bidirected complete graphs
- Hamilton decompositions of balanced complete multipartite graphs with primitive leaves
This page was built for publication: Hamiltonian decompositions of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795057)
