Packing trees into \(n\)-chromatic graphs

DOI10.7151/dmgt.1735zbMath1292.05213OpenAlexW2049995225MaRDI QIDQ2442277

András Gyárfás

Publication date: 2 April 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1735

zbMATH Keywords

tree packing

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Problems close to my heart ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• Induced subtrees in graphs of large chromatic number
• Generalizations of the tree packing conjecture
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing trees into \(n\)-chromatic graphs