Pages that link to "Item:Q2778281"
From MaRDI portal
The following pages link to Even-hole-free graphs part I: Decomposition theorem (Q2778281):
Displayed 19 items.
- Graphs of separability at most 2 (Q415268) (← links)
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
- Bisimplicial vertices in even-hole-free graphs (Q958679) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (Q1827853) (← links)
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880) (← links)
- Detecting 2-joins faster (Q2376790) (← links)
- A polynomial recognition algorithm for balanced matrices (Q2565686) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- Even-hole-free graphs part II: Recognition algorithm (Q3150171) (← links)
- Even-hole-free planar graphs have bounded treewidth (Q3503541) (← links)
- The Induced Disjoint Paths Problem (Q3503839) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)