The following pages link to Clique-coloring claw-free graphs (Q2631088):
Displayed 10 items.
- Clique colourings of geometric graphs (Q668027) (← links)
- Clique-coloring of \(K_{3,3}\)-minor free graphs (Q826557) (← links)
- A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs (Q2023732) (← links)
- 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)
- Clique chromatic numbers of intersection graphs (Q2313617) (← links)
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4 (Q2657098) (← links)
- HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS (Q5148052) (← links)