Pages that link to "Item:Q2275368"
From MaRDI portal
The following pages link to On lower bounds for the chromatic number in terms of vertex degree (Q2275368):
Displaying 5 items.
- Bounds for the chromatic number of graphs with partial information (Q1869218) (← links)
- On bounding the chromatic number of L-graphs (Q1918550) (← links)
- New bounds for the chromatic number of graphs (Q3506313) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) (Q6038583) (← links)