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):

Displaying 10 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)
• Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors (Q6046645) (← links)
• A note on \(\Delta\)-critical graphs (Q6063276) (← links)
• The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree (Q6091818) (← links)
• Special issue in honour of Landon Rabern (Q6091821) (← links)
• Strengthening Brooks' chromatic bound on \(P_6\)-free graphs (Q6143873) (← links)
• Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)