The following pages link to Linear choosability of graphs (Q932648):
Displaying 15 items.
- Linear coloring of planar graphs without 4-cycles (Q354457) (← links)
- 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)
- Improved bounds on linear coloring of plane graphs (Q625757) (← links)
- Upper bounds on the linear chromatic number of a graph (Q626759) (← links)
- \(k\)-forested coloring of planar graphs with large girth (Q632996) (← links)
- Frugal, acyclic and star colourings of graphs (Q643020) (← 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)
- Linear coloring of graphs embeddable in a surface of nonnegative characteristic (Q1041551) (← links)
- New upper bounds on linear coloring of planar graphs (Q1757984) (← links)
- Linear list coloring of some sparse graphs (Q2214305) (← links)
- Linear choosability of sparse graphs (Q2275448) (← links)
- Linear colorings of subcubic graphs (Q2444734) (← links)
