Factorizations of complete graphs into caterpillars of diameter 5

DOI10.1016/J.DISC.2009.03.040zbMath1220.05098OpenAlexW1967615557WikidataQ114190782 ScholiaQ114190782MaRDI QIDQ960966

Petr Kovář, Dalibor Fronček, Michael Kubesa, Tereza Kovářová

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10084/77834

zbMATH Keywords

graph labelingspanning treesgraph factorizationcaterpillars

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Factorizations of complete graphs into brooms ⋮ Factorizations of complete graphs into tadpoles

Cites Work

• Bi-cyclic decompositions of complete graphs into spanning trees
• Factorizations of complete graphs into \([n,r,s,2\)-caterpillars of diameter 5 with maximum center]
• Factorizations of complete graphs into \([n,r,s,2\)-caterpillars of diameter 5 with maximum end]
• Cyclic decompositions of complete graphs into spanning trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Factorizations of complete graphs into caterpillars of diameter 5