Pages that link to "Item:Q1025560"
From MaRDI portal
The following pages link to Triangle-free strongly circular-perfect graphs (Q1025560):
Displaying 6 items.
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514) (← links)
- On strongly circular-perfectness (Q3439367) (← links)
- Claw‐free circular‐perfect graphs (Q5893933) (← links)
