Pages that link to "Item:Q941623"
From MaRDI portal
The following pages link to Planar triangulations with real chromatic roots arbitrarily close to 4 (Q941623):
Displaying 11 items.
- The number of colorings of planar graphs with no separating triangles (Q345111) (← links)
- Chromatic bounds on orbital chromatic roots (Q463065) (← links)
- Is the five-flow conjecture almost false? (Q463296) (← links)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial (Q2391044) (← links)
- A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings (Q3161084) (← links)
- Density of Chromatic Roots in Minor-Closed Graph Families (Q4554778) (← links)
- Chromatic Roots are Dense in the Whole Complex Plane (Q4819237) (← links)
- (Q5869435) (← links)
- A derivation of an affine plane of order 4 from a triangle-free 3-colored \(K_{16}\) (Q5937929) (← links)
- Improved bounds for the zeros of the chromatic polynomial via Whitney's broken circuit theorem (Q6615755) (← links)
