\(H\)-packing of \(k\)-chromatic graphs
From MaRDI portal
Publication:1937363
zbMath1267.05149MaRDI QIDQ1937363
Publication date: 28 February 2013
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Edge-decompositions of graphs with high minimum degree ⋮ Edge-decompositions of graphs with high minimum degree ⋮ On the decomposition threshold of a given graph
This page was built for publication: \(H\)-packing of \(k\)-chromatic graphs
