Certificates for properties of stability polynomials of graphs
From MaRDI portal
(Redirected from Publication:405176)
Recommendations
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)