Almost regular edge colorings and regular decompositions of complete graphs
From MaRDI portal
Publication:3614746
Recommendations
Cites work
- scientific article; zbMATH DE number 1996256 (Why is no real title available?)
- Amalgamations of connected \(k\)-factorizations.
- Cycle decompositions of complete graphs
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
- Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of kkn+1
- Hamiltonian decompositions of complete graphs
- On embedding incomplete symmetric Latin squares
- Packing Trees into the Complete Graph
- Packing circuits into \(K_N\).
- Packings of graphs and applications to computational complexity
Cited in
(9)- Asymptotic enumeration of \(k\)-edge-colored \(k\)-regular graphs
- r-Regular, r-connected decompositions of complete graphs
- scientific article; zbMATH DE number 3505018 (Why is no real title available?)
- Hamilton path decompositions of complete multipartite graphs
- Edge-colouring of joins of regular graphs. II
- On almost-regular edge colourings of hypergraphs
- Amalgamations of almost regular edge-colourings of simple graphs
- An algorithm for finding factorizations of complete graphs
- scientific article; zbMATH DE number 4049679 (Why is no real title available?)
This page was built for publication: Almost regular edge colorings and regular decompositions of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614746)