Pages that link to "Item:Q1618249"
From MaRDI portal
The following pages link to Graphs are \((1, \varDelta + 1)\)-choosable (Q1618249):
Displaying 13 items.
- Every graph is \((2,3)\)-choosable (Q519997) (← links)
- 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)
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (Q1660241) (← links)
- Total list weighting of graphs with bounded maximum average degree (Q1660242) (← 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)
- (\(1,\lambda\))-embedded graphs and the acyclic edge choosability (Q2890349) (← links)
- Bounding the monomial index and \((1,l)\)-weight choosability of a graph (Q2928589) (← links)
- (Q2936690) (← links)
