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/S0161171283000617MaRDI QIDQ795840zbMATH OpenOpenAlexFDO

Authors 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 coverspanning subgraphpath polynomial

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)

Recommendations

• On coefficients of path polynomials
• scientific article; zbMATH DE number 3959470
• Path decompositions of chains and circuits
• scientific article; zbMATH DE number 4160782
• Simple path covers in graphs

Cited in

(12)

• Graph polynomials
• scientific article; zbMATH DE number 2114513 (Why is no real title available?)
• On F-polynomials of thistles
• scientific article; zbMATH DE number 3959470 (Why is no real title available?)
• scientific article; zbMATH DE number 3948328 (Why is no real title available?)
• The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences
• A linear algorithm for the number of degree constrained subforests of a tree
• On the edge cover polynomial of a graph
• Path decompositions of chains and circuits
• On coefficients of path polynomials
• scientific article; zbMATH DE number 4160782 (Why is no real title available?)
• Simple path covers in graphs

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

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