Certificates for properties of stability polynomials of graphs
zbMATH Open1300.05137MaRDI QIDQ405176FDOQ405176
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The independence polynomial of rooted products of graphs
- Certificates of factorisation for chromatic polynomials
- Certificates of factorisation for a class of triangle-free graphs
- Title not available (Why is that?)
- Non-bipartite chromatic factors
- Short certificates for chromatic equivalence
- Pairs of chromatically equivalent graphs
- A correlation inequality involving stable set and chromatic polynomials
Cited In (6)
- 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
- Certificates of factorisation for chromatic polynomials
- Certificates of factorisation for a class of triangle-free graphs
- 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)
