Path decompositions of chains and circuits

DOI10.1155/S0161171283000472zbMATH Open0538.05043OpenAlexW2150359458MaRDI QIDQ793050FDOQ793050

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/45373

Recommendations

• scientific article; zbMATH DE number 3959470
• On coefficients of path polynomials
• 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 4087710
• scientific article; zbMATH DE number 3931061

zbMATH Keywords

path decompositionpath polynomial

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (11)

• Higher-order matching polynomials and \(d\)-orthogonality
• Title not available (Why is that?)
• Title not available (Why is that?)
• The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences
• On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
• Title not available (Why is that?)
• On coefficients of path polynomials
• Title not available (Why is that?)
• New results on path-decompositions and their down-links
• Paths algebra, similarities and system decomposition
• Title not available (Why is that?)

This page was built for publication: Path decompositions of chains and circuits

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