Packing almost stars into the complete graph

DOI<169::AID-JGT9>3.0.CO;2-K 10.1002/(SICI)1097-0118(199706)25:2<169::AID-JGT9>3.0.CO;2-KzbMath0884.05070OpenAlexW4233359355MaRDI QIDQ4344220

Edward Dobson

Publication date: 8 March 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199706)25:2<169::aid-jgt9>3.0.co;2-k

zbMATH Keywords

treepacking

Mathematics Subject Classification ID

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

Related Items (4)

Packing spanning graphs from separable families ⋮ Domination in certain chemical graphs ⋮ Packing in honeycomb networks ⋮ Packing trees of unbounded degrees in random graphs

This page was built for publication: Packing almost stars into the complete graph