Packing graphs with odd and even trees

DOI10.1002/jgt.3190070309zbMath0556.05020OpenAlexW2090733729MaRDI QIDQ3220604

Peter C. Fishburn

Publication date: 1983

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190070309

zbMATH Keywords

pathGraham's conjecturedouble startree-packingcaterpillar spiderGyárfás- Lehel conjecturescorpiontriple star

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of packing and covering (05B40)

Related Items (3)

A note on packing trees into complete bipartite graphs and on Fishburn's conjecture ⋮ Two packing problems on \(k\)-matroid trees ⋮ Packing of graphs - a survey

Cites Work

• Failure of Nielsen's theorem in higher dimensions

This page was built for publication: Packing graphs with odd and even trees