Pages that link to "Item:Q713164"

The following pages link to Critically paintable, choosable or colorable graphs (Q713164):

Displayed 3 items.

• Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) ‎ (← links)
• Improved lower bounds on the number of edges in list critical and online list critical graphs (Q2284728) ‎ (← links)
• Characterization of \((2m,m)\)-paintable graphs (Q2344816) ‎ (← links)