Factorizations of complete graphs into trees with at most four non-leave vertices

DOI10.1007/S00373-010-0991-0MaRDI QIDQ659732zbMATH OpenOpenAlexWikidataFDO

Authors P. Kovář, Michael Kubesa, Dalibor Fronček

Publication date 24 January 2012

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-010-0991-0

zbMATH Keywords

spanning treesgraph factorizationgraph labeling

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• scientific article; zbMATH DE number 1933250 (Why is no real title available?)
• scientific article; zbMATH DE number 2170403 (Why is no real title available?)
• scientific article; zbMATH DE number 2174608 (Why is no real title available?)
• 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

Cited in

(2)

• Factorizations of complete graphs into tadpoles
• scientific article; zbMATH DE number 5054173 (Why is no real title available?)

This page was built for publication: Factorizations of complete graphs into trees with at most four non-leave vertices

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