On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs

DOI10.1155/S0161171283000617zbMath0543.05037OpenAlexW2155723899MaRDI QIDQ795840

E. J. Farrell

Publication date: 1983

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/45380

zbMATH Keywords

path polynomialpath coverspanning subgraph

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

On F-polynomials of thistles ⋮ A linear algorithm for the number of degree constrained subforests of a tree

This page was built for publication: On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs