scientific article; zbMATH DE number 3977047

zbMATH Open0605.05035MaRDI QIDQ3743340FDOQ3743340

Authors: Zdzisław Skupień, Wladyslaw Zygmunt 

Publication date: 1986

Title of this publication is not available (Why is that?)

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

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)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)