Hamiltonian decompositions of complete regular s-partite graphs
From MaRDI portal
Publication:1076042
DOI10.1016/0012-365X(86)90186-XzbMath0593.05047OpenAlexW1985986354MaRDI QIDQ1076042
C. A. Rodger, Anthony J. W. Hilton
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(86)90186-x
Related Items (31)
Decomposition of cartesian product of complete graphs into sunlet graphs of order eight ⋮ Cycle systems in the complete bipartite graph minus a one-factor ⋮ Amalgamations of factorizations of complete equipartite graphs ⋮ 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 ⋮ 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 ⋮ Connected Baranyai's theorem ⋮ 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 ⋮ Hamilton decompositions of complete graphs with a 3-factor leave. ⋮ Large sets of Hamilton cycle decompositions of complete bipartite graphs ⋮ Outline symmetric Latin squares ⋮ Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences ⋮ Embedding Factorizations for 3-Uniform Hypergraphs ⋮ Amalgamating infinite Latin squares ⋮ Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach ⋮ Factorizations of product graphs into cycles of uniform length ⋮ Fractional latin squares, simplex algebras, and generalized quotients ⋮ Hamiltonicity in vertex envelopes of plane cubic graphs ⋮ Fair Hamilton decompositions of complete multipartite graphs ⋮ Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian decompositions of complete graphs
- Generalized latin rectangles I: Construction and decomposition
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Generalized latin rectangles. II: Embedding
- Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares
- Connected Detachments of Graphs and Generalized Euler Trails
- 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 regular s-partite graphs
