The following pages link to Claw‐free circular‐perfect graphs (Q5893933):
Displaying 10 items.
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- On minimally circular-imperfect graphs (Q932581) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- On cycle-nice claw-free graphs (Q2138970) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs (Q2364493) (← links)
- Claw-free strictly Deza graphs (Q2403679) (← links)
- Minimal circular-imperfect graphs of large clique number and large independence number (Q2427550) (← links)
- (Q3469132) (← links)
- Claw-free circular-perfect graphs (Q5900081) (← links)