Pages that link to "Item:Q2194741"
From MaRDI portal
The following pages link to Weight choosability of graphs with maximum degree 4 (Q2194741):
Displaying 4 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)
- On the Power of Nodes of Degree Four in the Local Max-Cut Problem (Q3563008) (← links)