Pages that link to "Item:Q1406025"
From MaRDI portal
The following pages link to On linear and circular structure of (claw, net)-free graphs (Q1406025):
Displaying 11 items.
- On distance-3 matchings and induced matchings (Q716178) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648) (← links)
- An \(\mathcal O(n\sqrt m)\) algorithm for the weighted stable set problem in \{claw, net\}-free graphs with \(\alpha(G)\geq 4\) (Q1751148) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- The computational complexity of three graph problems for instances with bounded minors of constraint matrices (Q2357129) (← links)
- Dominating and large induced trees in regular graphs (Q2463903) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- Proper Interval Vertex Deletion (Q3058706) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
