Pages that link to "Item:Q1660241"
From MaRDI portal
The following pages link to Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (Q1660241):
Displaying 5 items.
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
- Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree (Q1882146) (← links)
- On a list variant of the multiplicative 1-2-3 conjecture (Q2135540) (← links)
- Every nice graph is (1,5)-choosable (Q2171030) (← links)
- Total weight choosability of graphs with bounded maximum average degree (Q2397545) (← links)