Pages that link to "Item:Q2275448"
From MaRDI portal
The following pages link to Linear choosability of sparse graphs (Q2275448):
Displaying 10 items.
- On linear coloring of planar graphs with small girth (Q400495) (← links)
- Linear coloring of sparse graphs (Q412383) (← links)
- A result on linear coloring of planar graphs (Q456164) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Linear and 2-frugal choosability of graphs of small maximum average degree (Q659749) (← links)
- \(k\)-forested choosability of planar graphs and sparse graphs (Q764887) (← links)
- List-recoloring of sparse graphs (Q2145762) (← links)
- Linear list coloring of some sparse graphs (Q2214305) (← links)
- Linear colorings of subcubic graphs (Q2444734) (← links)
- Linear list r-hued coloring of sparse graphs (Q4577851) (← links)
