Pages that link to "Item:Q2482095"
From MaRDI portal
The following pages link to On classes of minimal circular-imperfect graphs (Q2482095):
Displaying 13 items.
- 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)
- Grinstead's conjecture is true for graphs with a small clique number (Q2433715) (← links)
- Some aspects of minimal imperfect graphs (Q2758338) (← links)
- Circular-imperfection of triangle-free graphs (Q3503467) (← links)
- On minimal imperfect graphs with circular symmetry (Q4242951) (← links)
- Claw‐free circular‐perfect graphs (Q5893933) (← links)
- Claw-free circular-perfect graphs (Q5900081) (← links)
- A circle criterion for a generalized cross graph in terms of minimal excluded minors (Q6178302) (← links)