Factorizations of complete graphs into spanning trees with all possible maximum degrees

DOI10.1007/978-3-642-10217-2_33MaRDI QIDQ3651560zbMATH OpenOpenAlexFDO

Authors P. Kovář, Michael Kubesa

Publication date 11 December 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10217-2_33

zbMATH Keywords

complete graphsfactorizationspanning trees

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1933250
• scientific article; zbMATH DE number 2174608
• scientific article; zbMATH DE number 2235052
• Bi-cyclic decompositions of complete graphs into spanning trees
• Factorizations of complete graphs into caterpillars of diameter 5

Cited in

(6)

• scientific article; zbMATH DE number 3977047 (Why is no real title available?)
• Factorizations of complete graphs into brooms
• scientific article; zbMATH DE number 1933250 (Why is no real title available?)
• scientific article; zbMATH DE number 2174608 (Why is no real title available?)
• Factorizations of complete graphs into tadpoles
• scientific article; zbMATH DE number 2235052 (Why is no real title available?)

This page was built for publication: Factorizations of complete graphs into spanning trees with all possible maximum degrees

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