Amalgamations of factorizations of complete graphs

DOI10.1016/j.jctb.2006.09.004zbMath1153.05055OpenAlexW2028272793MaRDI QIDQ885295

Matthew Johnson

Publication date: 8 June 2007

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

Full work available at URL: http://dro.dur.ac.uk/1908/1/1908.pdf

zbMATH Keywords

embeddingsfactorizationsamalgamations

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items

Embedding connected factorizations ⋮ Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations ⋮ Multiply balanced edge colorings of multigraphs ⋮ Factorizations of complete multipartite hypergraphs ⋮ Detachments of Hypergraphs I: The Berge–Johnson Problem ⋮ Connected Baranyai's theorem ⋮ Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences ⋮ Embedding Factorizations for 3-Uniform Hypergraphs

Cites Work

• Hamiltonian decompositions of complete graphs
• Hamiltonian decompositions of complete regular s-partite graphs
• Amalgamations of almost regular edge-colourings of simple graphs
• Generalized latin rectangles. II: Embedding
• Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares
• Amalgamations of connected \(k\)-factorizations.
• Connected Detachments of Graphs and Generalized Euler Trails
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1
• An algorithm for finding factorizations of complete graphs
• Decompositions of Complete Graphs