scientific article; zbMATH DE number 2170403

MaRDI QIDQ4677891zbMATH OpenFDO

Authors Tereza Kovářová

Publication date 23 May 2005

zbMATH Keywords

caterpillarsfactorizationvertex labeling

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

• scientific article; zbMATH DE number 2235062
• Note on factorization of complete graphs into caterpillars with small diameters
• Factorizations of complete graphs into caterpillars of diameter 5
• scientific article; zbMATH DE number 2174608
• 2n-cyclic blended labeling of graphs.

Cited in

(5)

• 2n-cyclic blended labeling of graphs.
• Factorizations of complete graphs into brooms
• scientific article; zbMATH DE number 5180853 (Why is no real title available?)
• Factorizations of complete graphs into trees with at most four non-leave vertices
• Factorizations of complete graphs into caterpillars of diameter 5

This page was built for publication:

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