Pages that link to "Item:Q1849500"
From MaRDI portal
The following pages link to On the chromatic polynomial of a graph (Q1849500):
Displaying 17 items.
- On the absolute sum of chromatic polynomial coefficient of graphs (Q539349) (← links)
- An inequality for chromatic polynomials (Q1197039) (← links)
- Bounds to the chromatic polynomial of a graph (Q1384128) (← links)
- Proof of a chromatic polynomial conjecture (Q1569069) (← links)
- An attempt to classify bipartite graphs by chromatic polynomials (Q1579550) (← links)
- The chromatic polynomial of a digraph (Q2056880) (← links)
- New bounds for chromatic polynomials and chromatic roots (Q2352058) (← links)
- On partial sums of chromatic polynomials (Q2760992) (← links)
- Some inequalities on chromatic polynomials (Q2778264) (← links)
- On injective chromatic polynomials of graphs (Q3451075) (← links)
- A note on the conditional chromatic polynomial (Q4313560) (← links)
- (Q4495689) (← links)
- Note on chromatic polynomials of the threshold graphs (Q5009948) (← links)
- (Q5598927) (← 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)
- Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations (Q6055397) (← links)
