Pages that link to "Item:Q1402880"

The following pages link to Zeros of chromatic and flow polynomials of graphs (Q1402880):

Displaying 28 items.

• Is the five-flow conjecture almost false? (Q463296) (← links)
• On complex zeros of the \(q\)-Potts partition function for a self-dual family of graphs (Q612022) (← links)
• Chromatic zeros on hierarchical lattices and equidistribution on parameter space (Q824267) (← links)
• A zero-free interval for flow polynomials of cubic graphs (Q858684) (← links)
• Bounds for the coefficients of flow polynomials (Q875944) (← links)
• Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial (Q902842) (← links)
• Tutte polynomials for counting and classifying orbits (Q960916) (← links)
• Gale duality bounds for roots of polynomials with nonnegative coefficients (Q965210) (← links)
• A little statistical mechanics for the graph theorist (Q973134) (← links)
• Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids (Q1044207) (← links)
• On graphs whose flow polynomials have real roots only (Q1658775) (← links)
• Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials (Q1690044) (← links)
• Fixed point polynomials of permutation groups. (Q1953509) (← links)
• Zero-free intervals of chromatic polynomials of hypergraphs (Q2005730) (← links)
• Novel results on partial Hosoya polynomials: an application in chemistry (Q2161874) (← links)
• Relations and bounds for the zeros of graph polynomials using vertex orbits (Q2180690) (← links)
• Graph measures with high discrimination power revisited: a random polynomial approach (Q2200600) (← links)
• Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
• On zero-free intervals of flow polynomials (Q2259860) (← links)
• Graphs whose flow polynomials have only integral roots (Q2275472) (← links)
• On graphs having no flow roots in the interval \((1,2)\) (Q2341075) (← links)
• Chromatic Roots and Minor-Closed Families of Graphs (Q2826216) (← links)
• Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs (Q3449868) (← links)
• Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials (Q4602373) (← links)
• Galois groups of chromatic polynomials (Q5169640) (← links)
• (Q5869435) (← links)
• A generalized Beraha conjecture for non-planar graphs (Q5964111) (← links)
• Improved bounds for the zeros of the chromatic polynomial via Whitney's broken circuit theorem (Q6615755) (← links)