Factorizations of complete graphs into brooms

DOI10.1016/J.DISC.2011.11.034zbMath1239.05152OpenAlexW2079122179WikidataQ114190762 ScholiaQ114190762MaRDI QIDQ409440

Petr Kovář, Mariusz Meszka, Michael Kubesa

Publication date: 13 April 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.034

zbMATH Keywords

graph labelingspanning treesgraph factorization

Mathematics Subject Classification ID

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

Related Items (1)

Cubic factorizations

Cites Work

• Bi-cyclic decompositions of complete graphs into spanning trees
• Factorizations of complete graphs into caterpillars of diameter 5
• Factorizations of complete graphs into \([n,r,s,2\)-caterpillars of diameter 5 with maximum center]
• Solution to the problem of Kubesa
• Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Factorizations of complete graphs into brooms