The following pages link to (Q3344031):
Displaying 18 items.
- Recognizing \(i\)-triangulated graphs in \(O(mn)\) time (Q294870) (← links)
- Substitution and \(\chi\)-boundedness (Q461725) (← links)
- Stable sets and graphs with no even holes (Q745687) (← links)
- Quasi-star-cutsets and some consequences (Q1600840) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- Decomposition techniques applied to the clique-stable set separation problem (Q1709553) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- Detecting strong cliques (Q2312812) (← links)
- 2-clique-bond of stable set polyhedra (Q2446841) (← links)
- Even-hole-free graphs part I: Decomposition theorem (Q2778281) (← links)
- Amalgams and χ-Boundedness (Q2958199) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- Coloring Meyniel graphs in linear time (Q3439304) (← links)
- Colouring Some Classes of Perfect Graphs Robustly (Q3439399) (← links)
- A mickey-mouse decomposition theorem (Q5101425) (← links)
- Strong cliques in diamond-free graphs (Q5919069) (← links)
