Pages that link to "Item:Q1618249"

The following pages link to Graphs are \((1, \varDelta + 1)\)-choosable (Q1618249):

Displaying 8 items.

• 1-2-3 Conjecture in digraphs: more results and directions (Q777370) (← links)
• Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability (Q831336) (← links)
• On a list variant of the multiplicative 1-2-3 conjecture (Q2135540) (← links)
• Dense Eulerian graphs are \((1, 3)\)-choosable (Q2152793) (← links)
• Every nice graph is (1,5)-choosable (Q2171030) (← links)
• Weight choosability of graphs with maximum degree 4 (Q2194741) (← links)
• 2-connected chordal graphs and line graphs are \((1,5)\)-choosable (Q2225433) (← links)
• (Q2936690) (← links)