Hamiltonian decompositions of complete graphs
From MaRDI portal
Publication:795057
DOI10.1016/0095-8956(84)90020-0zbMath0542.05044OpenAlexW2044484597MaRDI QIDQ795057
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
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (41)
Hamiltonian decompositions of complete regular s-partite graphs ⋮ Decomposition of cartesian product of complete graphs into sunlet graphs of order eight ⋮ Amalgamations of factorizations of complete equipartite graphs ⋮ Embedding connected factorizations ⋮ Multiply balanced edge colorings of multigraphs ⋮ Factorizations of complete multipartite hypergraphs ⋮ Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs ⋮ Detachments of Hypergraphs I: The Berge–Johnson Problem ⋮ Amalgamations of almost regular edge-colourings of simple graphs ⋮ Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\) ⋮ Amalgamated Factorizations of Complete Graphs ⋮ Maximal sets of Hamilton cycles inKn,n ⋮ On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs ⋮ Amalgamations of factorizations of complete graphs ⋮ Constructing day-balanced round-robin tournaments with partitions ⋮ On the multicolor size Ramsey number of stars and cliques ⋮ Connected Baranyai's theorem ⋮ Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs ⋮ Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\) ⋮ Amalgamations of connected \(k\)-factorizations. ⋮ Unnamed Item ⋮ Hamiltonian double Latin squares ⋮ Amalgamations and Equitable Block-Colorings ⋮ A constructive solution to the Oberwolfach problem with a large cycle ⋮ Hamilton decompositions of complete graphs with a 3-factor leave. ⋮ Outline symmetric Latin squares ⋮ Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences ⋮ Embedding Factorizations for 3-Uniform Hypergraphs ⋮ A note on Hamiltonian decomposition of Bubble-Sort graphs ⋮ Hamilton decompositions of balanced complete multipartite graphs with primitive leaves ⋮ Amalgamating infinite Latin squares ⋮ Almost regular edge colorings and regular decompositions of complete graphs ⋮ Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach ⋮ \(G\)-designs and related designs ⋮ Fractional latin squares, simplex algebras, and generalized quotients ⋮ Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations ⋮ An approximate version of Jackson’s conjecture ⋮ Hamilton decompositions of graphs with primitive complements ⋮ Fair Hamilton decompositions of complete multipartite graphs ⋮ Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames ⋮ On the intricacy of combinatorial construction problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized latin rectangles I: Construction and decomposition
- Generalized latin rectangles. II: Embedding
- 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
- School Timetables
- Match-Tables
- On A Particular Conference Scheduling Problem
This page was built for publication: Hamiltonian decompositions of complete graphs
