Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of kkn+1

DOI10.1002/JGT.3190190205MaRDI QIDQ4326537zbMATH OpenOpenAlexWikidataFDO

Authors C. A. Rodger, E. B. Wantland

Publication date 11 June 1995

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190190205

zbMATH Keywords

embeddingamalgamationsedge-coloringsedge- coloring\(k\)-factorizations2-edge-connected \(k\)-factor decomposition

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Amalgamations of connected \(k\)-factorizations.
• Embedding an edge-coloring of \(K(n^r;\lambda_1,\lambda_2)\) into a Hamiltonian decomposition of \(K(n^{r+2};\lambda_1,\lambda_2)\)
• Embedding connected factorizations
• Amalgamations of factorizations of complete graphs
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs

Cites work

• Graph theory with applications
• On Quadruple Systems

Cited in

(23)

• Embedding factorizations for 3-uniform hypergraphs
• Embedding an edge-coloring of \(K(n^r;\lambda_1,\lambda_2)\) into a Hamiltonian decomposition of \(K(n^{r+2};\lambda_1,\lambda_2)\)
• Amalgamations of factorizations of complete graphs
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• r-Regular, r-connected decompositions of complete graphs
• scientific article; zbMATH DE number 5202624 (Why is no real title available?)
• Multiply balanced edge colorings of multigraphs
• Detachments of hypergraphs I: The Berge-Johnson problem
• Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
• On the existence and embedding of edge-coloured graph decompositions.
• On regular set systems containing regular subsystems
• Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\)
• Amalgamations of connected \(k\)-factorizations.
• Fractional latin squares, simplex algebras, and generalized quotients
• scientific article; zbMATH DE number 1996256 (Why is no real title available?)
• Almost regular edge colorings and regular decompositions of complete graphs
• On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs
• Amalgamating infinite Latin squares
• Maximal sets of Hamilton cycles inKn,n
• Embedding connected factorizations
• Detachments of amalgamated 3-uniform hypergraphs: factorization consequences
• Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
• Amalgamations of factorizations of complete equipartite graphs

This page was built for publication: Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4326537)