The following pages link to On (4, 2)‐Choosable Graphs (Q5272926):
Displaying 8 items.
- Critically paintable, choosable or colorable graphs (Q713164) (← links)
- Total 4-choosability of series-parallel graphs (Q870016) (← links)
- A refinement of choosability of graphs (Q2284741) (← links)
- \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)
- A characterization of (4,2)‐choosable graphs (Q3299217) (← links)
- Graphs of degree 4 are 5-edge-choosable (Q4718735) (← links)
- The strong fractional choice number of 3‐choice‐critical graphs (Q6093154) (← links)
- Multiple list coloring of 3‐choice critical graphs (Q6134649) (← links)