Pages that link to "Item:Q906469"
From MaRDI portal
The following pages link to Coloring the square of graphs whose maximum average degree is less than 4 (Q906469):
Displaying 5 items.
- Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors (Q317434) (← links)
- 3-dynamic coloring of planar triangulations (Q1783610) (← links)
- Coloring squares of graphs with mad constraints (Q2009007) (← links)
- On coloring numbers of graph powers (Q2174571) (← links)
- Upper bound on chromatic number of square graph of sparse graphs (Q3385887) (← links)