Factorizations of complete graphs into \([n,r,s,2]\)-caterpillars of diameter 5 with maximum center
From MaRDI portal
Publication:1773844
zbMath1062.05121MaRDI QIDQ1773844
Publication date: 3 May 2005
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (3)
Factorizations of complete graphs into brooms ⋮ Factorizations of complete graphs into trees with at most four non-leave vertices ⋮ Factorizations of complete graphs into caterpillars of diameter 5
This page was built for publication: Factorizations of complete graphs into \([n,r,s,2]\)-caterpillars of diameter 5 with maximum center