The following pages link to Circular perfect graphs (Q4667799):
Displaying 21 items.
- The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities (Q295831) (← links)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- On circular critical graphs (Q796546) (← links)
- On minimally circular-imperfect graphs (Q932581) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- Minimal circular-imperfect graphs of large clique number and large independence number (Q2427550) (← links)
- On the theta number of powers of cycle graphs (Q2439827) (← links)
- On classes of minimal circular-imperfect graphs (Q2482095) (← links)
- Several parameters of generalized Mycielskians (Q2495898) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- Minimally circular-imperfect graphs with a major vertex (Q2581632) (← links)
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2857431) (← links)
- Clique and chromatic number of circular-perfect graphs (Q2883567) (← links)
- Convex-round graphs are circular-perfect (Q3150195) (← links)
- On strongly circular-perfectness (Q3439367) (← links)
- Circular-imperfection of triangle-free graphs (Q3503467) (← links)
- (Q3615804) (← links)
- Claw‐free circular‐perfect graphs (Q5893933) (← links)
- Claw-free circular-perfect graphs (Q5900081) (← links)
