Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of kkn+1
DOI10.1002/JGT.3190190205zbMATH Open0815.05050OpenAlexW2080048055WikidataQ114236083 ScholiaQ114236083MaRDI QIDQ4326537FDOQ4326537
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
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
embeddingamalgamationsedge-coloringsedge- coloring\(k\)-factorizations2-edge-connected \(k\)-factor decomposition
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)
Cites Work
Cited In (21)
- Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
- Title not available (Why is that?)
- Amalgamations of factorizations of complete equipartite graphs
- Embedding Factorizations for 3-Uniform Hypergraphs
- Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
- Multiply balanced edge colorings of multigraphs
- Embedding connected factorizations
- Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
- 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
- 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)\)
- Title not available (Why is that?)
- Fractional latin squares, simplex algebras, and generalized quotients
- Detachments of hypergraphs I: The Berge-Johnson problem
- Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences
- Almost regular edge colorings and regular decompositions of complete graphs
This page was built for publication: Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of kkn+1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4326537)
