Pages that link to "Item:Q5495890"
From MaRDI portal
The following pages link to Coloring Graphs with Dense Neighborhoods (Q5495890):
Displaying 11 items.
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
- Chromatic-choosability of hypergraphs with high chromatic number (Q668048) (← links)
- A strengthening of Brooks' theorem (Q1306303) (← links)
- Coloring graphs with sparse neighborhoods (Q1569053) (← links)
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques (Q2171021) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- \(\omega, \Delta\) and \(\chi\) (Q4242948) (← links)
- New bounds for the Moser‐Tardos distribution (Q5120743) (← links)
- Coloring dense digraphs (Q5919339) (← links)
- Special issue in honour of Landon Rabern (Q6091821) (← links)