Note on factorization of complete graphs into caterpillars with small diameters

zbMATH Open1116.05063MaRDI QIDQ3423982FDOQ3423982

Authors: Dalibor Fronček 

Publication date: 15 February 2007

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

Mathematics Subject Classification ID

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

Cited In (9)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Factorizations of complete graphs into brooms
• Title not available (Why is that?)

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)