Hamiltonian decompositions of complete graphs
From MaRDI portal
Publication:795057
DOI10.1016/0095-8956(84)90020-0zbMATH Open0542.05044OpenAlexW2044484597MaRDI QIDQ795057FDOQ795057
Authors: A. J. W. Hilton 
Publication date: 1984
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(84)90020-0
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
Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized latin rectangles. II: Embedding
- Generalized latin rectangles I: Construction and decomposition
- On A Particular Conference Scheduling Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- School Timetables
- Title not available (Why is that?)
- Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares
- The reconstruction of latin squares with applications to school timetabling and to experimental design
- Match-Tables
- Title not available (Why is that?)
Cited In (58)
- Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs
- 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 constructive solution to the Oberwolfach problem with a large cycle
- A method of finding edge disjoint Hamiltonian circuits of complete graphs of even order
- Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
- A note on Hamiltonian decomposition of bubble-sort graphs
- Connected Baranyai's theorem
- Hamilton decompositions of one-ended Cayley graphs
- Fair Hamilton decompositions of complete multipartite graphs
- Constructing day-balanced round-robin tournaments with partitions
- Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
- Hamilton decompositions of balanced complete multipartite graphs with primitive leaves
- Hamilton decompositions of graphs with primitive complements
- Hamilton decomposable graphs with specified leaves
- Amalgamations of factorizations of complete equipartite graphs
- The wonderful Walecki construction
- Multiply balanced edge colorings of multigraphs
- Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs
- Embedding connected factorizations
- Amalgamations and equitable block-colorings
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Amalgamations of almost regular edge-colourings of simple graphs
- On Hamilton cycle decompositions of the tensor product of complete graphs
- Detachments of amalgamated 3-uniform hypergraphs: factorization consequences
- Title not available (Why is that?)
- Decomposition of cartesian product of complete graphs into sunlet graphs of order eight
- An approximate version of Jackson's conjecture
- Hamilton decompositions of complete graphs with a 3-factor leave.
- Amalgamated Factorizations of Complete Graphs
- Amalgamations of factorizations of complete graphs
- On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs
- \(G\)-designs and related designs
- Amalgamations of connected \(k\)-factorizations.
- On the intricacy of combinatorial construction problems
- Maximal sets of Hamilton cycles inKn,n
- Amalgamating infinite Latin squares
- Computing complete graph isomorphisms and Hamiltonian cycles from partial ones
- Embedding factorizations for 3-uniform hypergraphs
- On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Constructions via Hamiltonian theorems
- Outline symmetric Latin squares
- Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\)
- Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach
- Pairwise compatible Hamilton decompositions of \(K_n\)
- TSP tour domination and Hamilton cycle decompositions of regular digraphs
- Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\)
- Decomposition of product graphs into sunlet graphs of order eight
- On the multicolor size Ramsey number of stars and cliques
- Hamiltonian decompositions of complete regular s-partite graphs
- Fractional latin squares, simplex algebras, and generalized quotients
- Nomadic decompositions of bidirected complete graphs
- Detachments of hypergraphs I: The Berge-Johnson problem
- Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames
- Factorizations of complete multipartite hypergraphs
- Hamiltonian double Latin squares
- Almost regular edge colorings and regular decompositions of complete graphs
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)
