The following pages link to Decomposition of perfect graphs (Q1072566):
Displaying 10 items.
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Boolean-width of graphs (Q719257) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- On perfectness of sums of graphs (Q1296974) (← links)
- Boolean-Width of Graphs (Q3656851) (← links)
- On critically perfect graphs (Q4719328) (← links)
- Domination graphs: Examples and counterexamples (Q5936465) (← links)
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)
