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/S0161171283000617zbMATH Open0543.05037OpenAlexW2155723899MaRDI QIDQ795840FDOQ795840

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

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

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)

Cited In (12)

• Path decompositions of chains and circuits
• Title not available (Why is that?)
• On F-polynomials of thistles
• Title not available (Why is that?)
• The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences
• On coefficients of path polynomials
• On the edge cover polynomial of a graph
• Title not available (Why is that?)
• Graph polynomials
• Simple path covers in graphs
• Title not available (Why is that?)
• 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

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