Note on factorization of complete graphs into caterpillars with small diameters

MaRDI QIDQ3423982zbMATH OpenFDO

Authors Dalibor Fronček

Publication date 15 February 2007

Mathematics Subject Classification ID

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

Recommendations

• Factorizations of complete graphs into caterpillars of diameter 5
• scientific article; zbMATH DE number 1874581
• 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
• scientific article; zbMATH DE number 5180853

Cited in

(9)

• scientific article; zbMATH DE number 2170403 (Why is no real title available?)
• Caterpillar factorizations of crowns.
• Characterizing when powers of a caterpillar are divisor graphs.
• The largest Laplacian and adjacency indices of complete caterpillars of fixed diameter
• Factorizations of complete graphs into caterpillars of diameter 5
• On caterpillar factors in graphs
• Factorizations of complete graphs into brooms
• scientific article; zbMATH DE number 5180853 (Why is no real title available?)
• scientific article; zbMATH DE number 4063140 (Why is no real title available?)

This page was built for publication: Note on factorization of complete graphs into caterpillars with small diameters

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