Pages that link to "Item:Q6045139"
From MaRDI portal
The following pages link to Upper bounds on the chromatic polynomial of a connected graph with fixed clique number (Q6045139):
Displaying 4 items.
- Chromatic number versus chromatic number in graphs with bounded clique number (Q2640609) (← links)
- Estimates of coefficients of chromatic polynomials and numbers of cliques of (c,n,m)-graphs (Q4797922) (← links)
- Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
- Independence number and maximal chromatic polynomials of connected graphs (Q6616432) (← links)