Pages that link to "Item:Q1366787"
From MaRDI portal
The following pages link to The largest real zero of the chromatic polynomial (Q1366787):
Displaying 17 items.
- On zeros of the characteristic polynomial of matroids of bounded tree-width (Q338570) (← links)
- The number of colorings of planar graphs with no separating triangles (Q345111) (← links)
- Is the five-flow conjecture almost false? (Q463296) (← links)
- Chromatic properties of Hamiltonian graphs (Q878611) (← links)
- Planar triangulations with real chromatic roots arbitrarily close to 4 (Q941623) (← links)
- A zero-free interval for chromatic polynomials (Q1197040) (← links)
- On upper bounds for real roots of chromatic polynomials (Q1827733) (← links)
- The largest non-integer real zero of chromatic polynomials of graphs with fixed order (Q1827734) (← links)
- On the chromatic roots of generalized theta graphs (Q1850569) (← links)
- Inapproximability of the Tutte polynomial of a planar graph (Q1926110) (← links)
- Zero-free intervals of chromatic polynomials of hypergraphs (Q2005730) (← links)
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial (Q2391044) (← links)
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. IV. Chromatic polynomial with cyclic boundary conditions (Q2492791) (← links)
- Maximal chromatic polynomials of connected planar graphs (Q3480061) (← links)
- On chromatic roots of large subdivisions of graphs (Q5957744) (← links)
- Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107) (← links)
- On the location of chromatic zeros of series-parallel graphs (Q6170518) (← links)
