Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs

DOI10.1002/jcd.1024zbMath0994.05125OpenAlexW2050766415WikidataQ114236298 ScholiaQ114236298MaRDI QIDQ2781050

C. A. Rodger, C. D. Leach

Publication date: 13 October 2002

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.1024

zbMATH Keywords

graph homomorphismamalgamationHamilton cycles2-factorizationmultipartite graphHamilton decompositions\(m\)-cycle system

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (15)

Multiply balanced edge colorings of multigraphs ⋮ Hamilton cycle rich 2-factorization of complete bipartite graphs ⋮ Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs ⋮ Detachments of Hypergraphs I: The Berge–Johnson Problem ⋮ Hamilton cycle rich 2-factorization of complete equipartite graphs. II ⋮ Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\) ⋮ Amalgamations and Equitable Block-Colorings ⋮ Maximal sets of Hamilton cycles in \(K_{2p}-F\) ⋮ Resolvable gregarious cycle decompositions of complete equipartite graphs ⋮ Hamilton decompositions of complete graphs with a 3-factor leave. ⋮ Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences ⋮ Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\) ⋮ Path and cycle decompositions of complete equipartite graphs: Four parts ⋮ Fair Hamilton decompositions of complete multipartite graphs ⋮ Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames

Cites Work

• Unnamed Item
• Quadratic leaves of maximal partial triple systems
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1
• Forest leaves and four-cycles

This page was built for publication: Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs