Pages that link to "Item:Q2352058"
From MaRDI portal
The following pages link to New bounds for chromatic polynomials and chromatic roots (Q2352058):
Displaying 13 items.
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
- Maximizing the number of \(x\)-colorings of 4-chromatic graphs (Q1709544) (← links)
- Extremal colorings and independent sets (Q1756103) (← links)
- On upper bounds for real roots of chromatic polynomials (Q1827733) (← links)
- Descent polynomials (Q1999732) (← links)
- Maximum number of colourings: 5-chromatic case (Q2323817) (← links)
- A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
- Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
- Chromatic roots at 2 and the Beraha number B10 (Q5066931) (← links)
- New expressions for order polynomials and chromatic polynomials (Q5110675) (← links)
- An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) (Q6038583) (← links)
- Upper bounds on the chromatic polynomial of a connected graph with fixed clique number (Q6045139) (← links)
- Independence number and maximal chromatic polynomials of connected graphs (Q6616432) (← links)
