Amalgamations of factorizations of complete graphs
From MaRDI portal
Recommendations
Cites work
- Amalgamations of almost regular edge-colourings of simple graphs
- Amalgamations of connected \(k\)-factorizations.
- An algorithm for finding factorizations of complete graphs
- Connected Detachments of Graphs and Generalized Euler Trails
- Decompositions of Complete Graphs
- Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of kkn+1
- Generalized latin rectangles. II: Embedding
- Hamiltonian decompositions of complete graphs
- Hamiltonian decompositions of complete regular s-partite graphs
- Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares
Cited in
(13)- Connected Baranyai's theorem
- Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of kkn+1
- Amalgamations of factorizations of complete equipartite graphs
- Multiply balanced edge colorings of multigraphs
- Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
- Embedding connected factorizations
- Detachments of amalgamated 3-uniform hypergraphs: factorization consequences
- scientific article; zbMATH DE number 5360814 (Why is no real title available?)
- Amalgamations of connected \(k\)-factorizations.
- Embedding factorizations for 3-uniform hypergraphs
- scientific article; zbMATH DE number 1047724 (Why is no real title available?)
- Detachments of hypergraphs I: The Berge-Johnson problem
- Factorizations of complete multipartite hypergraphs
This page was built for publication: Amalgamations of factorizations of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q885295)
