Almost regular edge colorings and regular decompositions of complete graphs
DOI10.1002/JCD.20190zbMATH Open1190.05065OpenAlexW1965899516MaRDI QIDQ3614746FDOQ3614746
Authors: Darryn Bryant, Barbara Maenhaut 
Publication date: 9 March 2009
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20190
Recommendations
graphdecompositiongraph packinggraph factorizationedge coloring techniqueHamilton cycle decomposotion
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Packings of graphs and applications to computational complexity
- Packing Trees into the Complete Graph
- Title not available (Why is that?)
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
- Amalgamations of connected \(k\)-factorizations.
- On embedding incomplete symmetric Latin squares
- Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of kkn+1
- Cycle decompositions of complete graphs
- Hamiltonian decompositions of complete graphs
- Packing circuits into \(K_N\).
Cited In (9)
- An algorithm for finding factorizations of complete graphs
- Amalgamations of almost regular edge-colourings of simple graphs
- On almost-regular edge colourings of hypergraphs
- Asymptotic enumeration of \(k\)-edge-colored \(k\)-regular graphs
- r-Regular, r-connected decompositions of complete graphs
- Title not available (Why is that?)
- Edge-colouring of joins of regular graphs. II
- Hamilton path decompositions of complete multipartite graphs
- Title not available (Why is that?)
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)
