The following pages link to (Q3575455):
Displaying 17 items.
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs (Q344543) (← links)
- The clique-transversal set problem in claw-free graphs with degree at most 4 (Q477680) (← links)
- Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982) (← links)
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Claw-free cubic graphs with clique-transversal number half of their order (Q533447) (← links)
- Clique-coloring of \(K_{3,3}\)-minor free graphs (Q826557) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs (Q1944214) (← 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)
- The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
- Coloring the cliques of line graphs (Q2401798) (← links)
- Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
- On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs (Q2452398) (← links)
- Clique-coloring claw-free graphs (Q2631088) (← links)
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4 (Q2657098) (← links)
- (Q5089217) (← links)