Pages that link to "Item:Q690473"
From MaRDI portal
The following pages link to Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473):
Displaying 14 items.
- Induced 2-regular subgraphs in \(k\)-chordal cubic graphs (Q266935) (← links)
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093) (← links)
- The \(k\)-regular induced subgraph problem (Q1786867) (← links)
- Sparse regular induced subgraphs in \(2P_3\)-free graphs (Q1799386) (← links)
- On the maximum independent set problem in subclasses of subcubic graphs (Q2018543) (← links)
- Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685) (← links)
- New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
- On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- From matchings to independent sets (Q2403787) (← links)
- Maximum subgraph problem for 3-regular Knödel graphs and its wirelength (Q6132556) (← links)
