Pages that link to "Item:Q2401798"
From MaRDI portal
The following pages link to Coloring the cliques of line graphs (Q2401798):
Displaying 5 items.
- On the complexity of local-equitable coloring of graphs (Q2077396) (← links)
- A generalization of Grötzsch Theorem on the local-equitable coloring (Q2110276) (← links)
- A linear-time algorithm for clique-coloring planar graphs (Q2294308) (← links)
- List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly (Q2297730) (← links)
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4 (Q2657098) (← links)