scientific article; zbMATH DE number 4160782

MaRDI QIDQ3487387zbMATH OpenFDO

Authors E. J. Farrell

Publication date 1987

zbMATH Keywords

algorithmbinary treeschainsnode disjoint path decompositionspath coveringpath polynomialstars

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
• scientific article; zbMATH DE number 3959470
• Path decompositions of chains and circuits
• Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results
• Decomposable trees: A polynomial algorithm for tripodes

Cited in

(6)

• A linear algorithm for the number of degree constrained subforests of a tree
• scientific article; zbMATH DE number 3959470 (Why is no real title available?)
• scientific article; zbMATH DE number 4127221 (Why is no real title available?)
• scientific article; zbMATH DE number 1744076 (Why is no real title available?)
• On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
• On the multiplicities of eigenvalues of a Hermitian matrix whose graph is 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 Q3487387)