Pages that link to "Item:Q2249737"
From MaRDI portal
The following pages link to Detecting fixed patterns in chordal graphs in polynomial time (Q2249737):
Displayed 18 items.
- Graph editing to a fixed target (Q344855) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Parameterized complexity of set-restricted disjoint paths on chordal graphs (Q2097221) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- Mim-width. I. Induced path problems (Q2174563) (← links)
- On strictly chordality-\(k\) graphs (Q2181248) (← links)
- The (theta, wheel)-free graphs. IV: Induced paths and cycles (Q2221936) (← links)
- Induced disjoint paths in circular-arc graphs in linear time (Q2629233) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- Contracting bipartite graphs to paths and cycles (Q5915810) (← links)
- Contracting bipartite graphs to paths and cycles (Q5920049) (← links)
- The complexity of contracting bipartite graphs into small cycles (Q6039435) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6039437) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- (Q6065396) (← links)
- Cops and robber on oriented graphs with respect to push operation (Q6132547) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q6166893) (← links)