Pages that link to "Item:Q3385887"
From MaRDI portal
The following pages link to Upper bound on chromatic number of square graph of sparse graphs (Q3385887):
Displaying 5 items.
- Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors (Q317434) (← links)
- Coloring the square of graphs whose maximum average degree is less than 4 (Q906469) (← links)
- Coloring squares of graphs with mad constraints (Q2009007) (← links)
- New upper bound on the chromatic number of the square of a planar graph (Q2824258) (← links)
- Precise upper bound for the strong edge chromatic number of sparse planar graphs (Q5495056) (← links)
