Pages that link to "Item:Q3419713"
From MaRDI portal
The following pages link to Clique-coloring some classes of odd-hole-free graphs (Q3419713):
Displaying 25 items.
- 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)
- Complexity of clique coloring and related problems (Q551168) (← links)
- Clique colourings of geometric graphs (Q668027) (← links)
- On the structure of bull-free perfect graphs (Q675887) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- Perfect graphs of arbitrarily large clique-chromatic number (Q896010) (← links)
- Lower bounds on the clique-chromatic numbers of some distance graphs (Q2043671) (← 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)
- New bounds on clique-chromatic numbers of Johnson graphs (Q2192124) (← 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)
- The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
- Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
- Clique-coloring claw-free graphs (Q2631088) (← links)
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4 (Q2657098) (← links)
- Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable (Q2800540) (← links)
- More Results on Clique-chromatic Numbers of Graphs with No Long Path (Q2945676) (← links)
- Subgraph-avoiding coloring of graphs (Q3553235) (← links)
- Complexity of clique-coloring odd-hole-free graphs (Q3652547) (← links)
- (Q5089217) (← links)
- Colouring clique-hypergraphs of circulant graphs (Q5925222) (← links)
- On the complexity of local-equitable coloring in claw-free graphs with small degree (Q6616437) (← links)
