Packing trees into n-chromatic graphs

DOI10.7151/DMGT.1735MaRDI QIDQ2442277zbMATH OpenOpenAlexFDO

Authors András Gyárfás

Publication date 2 April 2014

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

tree packing

Mathematics Subject Classification ID

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

Cites work

• Generalizations of the tree packing conjecture
• scientific article; zbMATH DE number 3604921 (Why is no real title available?)
• scientific article; zbMATH DE number 3623611 (Why is no real title available?)
• Induced subtrees in graphs of large chromatic number

Cited in

(6)

• Packing a number of copies of a \(( p , q )\)-graph
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Packingk-edge trees in graphs of restricted vertex degrees
• scientific article; zbMATH DE number 3924795 (Why is no real title available?)
• Problems close to my heart
• Packing large balanced trees into bipartite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442277)