Pages that link to "Item:Q472396"

The following pages link to Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396):

Displayed 4 items.

• Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) ‎ (← links)
• Chromatic-choosability of hypergraphs with high chromatic number (Q668048) ‎ (← links)
• Painting squares in \(\Delta^2-1\) shades (Q2629492) ‎ (← links)
• Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) ‎ (← links)