Pages that link to "Item:Q1660241"

The following pages link to Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (Q1660241):

Displayed 3 items.

• 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)