Certificates for properties of stability polynomials of graphs

zbMath1300.05137MaRDI QIDQ405176

Kerri Morgan, Ranjie Mo, Graham E. Farr

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p67

zbMATH Keywords

chromatic polynomialcertificates-factorisationstability equivalencestability polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Short certificates for chromatic equivalence ⋮ An infinite family of 2-connected graphs that have reliability factorisations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-bipartite chromatic factors
• Pairs of chromatically equivalent graphs
• A correlation inequality involving stable set and chromatic polynomials
• The independence polynomial of rooted products of graphs
• Certificates of factorisation for chromatic polynomials
• Certificates of factorisation for a class of triangle-free graphs
• Short certificates for chromatic equivalence

This page was built for publication: Certificates for properties of stability polynomials of graphs