Factorizations of complete graphs into brooms

DOI10.1016/J.DISC.2011.11.034zbMATH Open1239.05152OpenAlexW2079122179WikidataQ114190762 ScholiaQ114190762MaRDI QIDQ409440FDOQ409440

P. Kovář, Michael Kubesa, Mariusz Meszka

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

Recommendations

• Factorization of complete graphs into long double brooms
• scientific article
• scientific article; zbMATH DE number 3809592
• All Ramsey numbers for brooms in graphs
• Some problems about \(r\)-factorizations of complete graphs

zbMATH Keywords

spanning treesgraph factorizationgraph labeling

Mathematics Subject Classification ID

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

Cites Work

• Factorizations of complete graphs into \([n,r,s,2]\)-caterpillars of diameter 5 with maximum center
• Note on factorization of complete graphs into caterpillars with small diameters
• Solution to the problem of Kubesa
• Factorizations of complete graphs into spanning trees with all possible maximum degrees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bi-cyclic decompositions of complete graphs into spanning trees
• Factorizations of complete graphs into caterpillars of diameter 5

Cited In (1)

• Cubic factorizations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409440)