Amalgamations of connected \(k\)-factorizations.

DOI10.1016/S0095-8956(03)00030-3zbMath1033.05084MaRDI QIDQ1400963

E. B. Wantland, C. A. Rodger, Matthew Johnson, Anthony J. W. Hilton

Publication date: 17 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

edge-coloringcomplete graphamalgamationgraph factorization

Mathematics Subject Classification ID

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

Related Items (11)

Amalgamations of factorizations of complete equipartite graphs ⋮ Embedding connected factorizations ⋮ Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations ⋮ Multiply balanced edge colorings of multigraphs ⋮ Detachments of Hypergraphs I: The Berge–Johnson Problem ⋮ Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\) ⋮ Amalgamations of factorizations of complete graphs ⋮ Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences ⋮ Embedding Factorizations for 3-Uniform Hypergraphs ⋮ Amalgamating infinite Latin squares ⋮ Almost regular edge colorings and regular decompositions of complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)
• Hamiltonian decompositions of complete graphs
• Hamiltonian decompositions of complete regular s-partite graphs
• Amalgamations of almost regular edge-colourings of simple graphs
• Decomposition of complete multigraphs into stars
• Generalized latin rectangles. II: Embedding
• The embedding of partial triple systems when 4 divides \(\lambda\)
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Embeddings of Steiner triple systems
• Cycle decompositions III: Complete graphs and fixed length cycles
• On Quadruple Systems
• Connected Detachments of Graphs and Generalized Euler Trails
• Embedding Partial Steiner Triple Systems
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1
• Embedding directed and undirected partial cycle systems of index λ > 1

This page was built for publication: Amalgamations of connected \(k\)-factorizations.