The following pages link to (Q4500707):
Displayed 11 items.
- Stable sets and graphs with no even holes (Q745687) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- A note on chromatic number of (cap, even hole)-free graphs (Q1712540) (← links)
- A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Even-hole-free graphs part I: Decomposition theorem (Q2778281) (← links)
- A Class of Three‐Colorable Triangle‐Free Graphs (Q4916101) (← links)
- (Q5743476) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels (Q6080861) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth (Q6080868) (← links)