Pages that link to "Item:Q493652"
From MaRDI portal
The following pages link to Finding disjoint paths in split graphs (Q493652):
Displaying 11 items.
- Finding disjoint paths with related path costs (Q857785) (← links)
- Splitting a graph into disjoint induced paths or cycles. (Q1408827) (← links)
- Finding multiple induced disjoint paths in general graphs (Q1944193) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
- (Q4949793) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918405) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918624) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)