Pages that link to "Item:Q3150195"
From MaRDI portal
The following pages link to Convex-round graphs are circular-perfect (Q3150195):
Displaying 6 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 circular-perfect graphs: a survey (Q2225429) (← links)
- Minimal circular-imperfect graphs of large clique number and large independence number (Q2427550) (← links)
- Minimally circular-imperfect graphs with a major vertex (Q2581632) (← links)
