Pages that link to "Item:Q2171030"
From MaRDI portal
The following pages link to Every nice graph is (1,5)-choosable (Q2171030):
Displaying 7 items.
- An improved upper bound on edge weight choosability of graphs (Q497381) (← links)
- Every graph is \((2,3)\)-choosable (Q519997) (← links)
- Graphs are \((1, \varDelta + 1)\)-choosable (Q1618249) (← links)
- Total weight choosability of graphs: towards the 1-2-3-conjecture (Q2033917) (← links)
- 2-connected chordal graphs and line graphs are \((1,5)\)-choosable (Q2225433) (← links)
- A solution to the 1-2-3 conjecture (Q6196158) (← links)
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment (Q6568836) (← links)