Certificates for properties of stability polynomials of graphs

MaRDI QIDQ405176zbMATH OpenFDO

Authors Ranjie Mo, Kerri Morgan, Graham 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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)

Recommendations

• Certificates of factorisation for chromatic polynomials
• On the stability of independence polynomials
• Certificates of factorisation for a class of triangle-free graphs
• Short certificates for chromatic equivalence
• Non-bipartite chromatic factors

Cites work

• scientific article; zbMATH DE number 3836093 (Why is no real title available?)
• scientific article; zbMATH DE number 3468904 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• A correlation inequality involving stable set and chromatic polynomials
• Certificates of factorisation for a class of triangle-free graphs
• Certificates of factorisation for chromatic polynomials
• Non-bipartite chromatic factors
• Pairs of chromatically equivalent graphs
• Short certificates for chromatic equivalence
• The independence polynomial of rooted products of graphs

Cited in

(6)

• Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
• Certificates of factorisation for chromatic polynomials
• Certificates of factorisation for a class of triangle-free graphs
• Short certificates for chromatic equivalence
• An infinite family of 2-connected graphs that have reliability factorisations
• Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials

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

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