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

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

(24)

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

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)