On graph invariants given by linear recurrence relations

DOI10.1016/0095-8956(90)90127-LzbMath0748.05087OpenAlexW1990884041MaRDI QIDQ1812827

David N. Yetter

Publication date: 25 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90127-l

zbMATH Keywords

linear recurrence relationsgraph invariants

Mathematics Subject Classification ID

Applications of graph theory (05C90)

Related Items

Knots and Graphs: Two Centuries of Interaction, A Most General Edge Elimination Polynomial, Chromatic invariants for finite graphs: Theme and polynomial variations, Confluence theory for graphs, A new invariant of plane bipartite cubic graphs, New results for the Martin polynomial, An extension of the bivariate chromatic polynomial

Cites Work

• Generalized chromatic polynomials
• Approximations for chromatic polynomials
• On theories with a combinatorial definition of 'equivalence'
• A new polynomial invariant of knots and links
• Some Properties of Conversion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item