Monochromatic Kr‐Decompositions of Graphs
From MaRDI portal
Publication:5418770
DOI10.1002/jgt.21750zbMath1294.05128OpenAlexW1553171679MaRDI QIDQ5418770
Publication date: 28 May 2014
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21750
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Monochromatic Clique Decompositions of Graphs ⋮ Minimum rainbow \(H\)-decompositions of graphs ⋮ Minimum rainbow \(H\)-decompositions of graphs
Cites Work
- Unnamed Item
- Minimum \(H\)-decompositions of graphs: edge-critical case
- Integer and fractional packings in dense graphs
- On the number of edge disjoint cliques in graphs of given size
- On a conjecture of Tuza about packing and covering of triangles
- Minimum \(H\)-decompositions of graphs
- Decompositions of graphs into 5-cycles and other small graphs
- Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing
- On complete subgraphs of different orders
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- The Representation of a Graph by Set Intersections
- On the maximal triangle-free edge-chromatic graphs in three colors
- On the structure of linear graphs
- Combinatorial Relations and Chromatic Graphs
This page was built for publication: Monochromatic Kr‐Decompositions of Graphs