Pages that link to "Item:Q626759"
From MaRDI portal
The following pages link to Upper bounds on the linear chromatic number of a graph (Q626759):
Displaying 5 items.
- Linear coloring of planar graphs without 4-cycles (Q354457) (← links)
- On linear coloring of planar graphs with small girth (Q400495) (← links)
- A result on linear coloring of planar graphs (Q456164) (← links)
- Linear list coloring of some sparse graphs (Q2214305) (← links)
- Linear colorings of subcubic graphs (Q2444734) (← links)
