scientific article; zbMATH DE number 3977047

MaRDI QIDQ3743340zbMATH OpenFDO

Authors Zdzisław Skupień, Wladyslaw Zygmunt

Publication date 1986

zbMATH Keywords

treemaximum path-factorvertex-path partition number

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 3983182
• Factorizations of complete graphs into spanning trees with all possible maximum degrees
• Maximal path length of binary trees
• Generating the maximum spanning trees of a weighted graph
• Maximum induced trees in graphs
• On generating all binary trees
• Path-factors in the square of a tree
• Finding a length-constrained maximum-density path in a tree
• Algorithms and Computation

Cited in

(3)

• scientific article; zbMATH DE number 15372 (Why is no real title available?)
• scientific article; zbMATH DE number 3983182 (Why is no real title available?)
• Long cycles and long paths in the Kronecker product of a cycle and a tree

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 Q3743340)