Pages that link to "Item:Q2172606"
From MaRDI portal
The following pages link to Exact square coloring of certain classes of graphs: complexity and algorithms (Q2172606):
Displaying 5 items.
- Coloring the square of Sierpiński graphs (Q497382) (← links)
- An optimal square coloring of planar graphs (Q1928491) (← links)
- On square-free vertex colorings of graphs (Q3539570) (← links)
- Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
- Complexity and algorithms for injective edge coloring of graphs (Q6132966) (← links)