Pages that link to "Item:Q1853148"
From MaRDI portal
The following pages link to Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148):
Displaying 23 items.
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- Complexity results for equistable graphs and related classes (Q646721) (← links)
- On minimal prime extensions of a four-vertex graph in a prime graph (Q704276) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- The stable set polytope for some extensions of \(P_4\)-free graphs (Q998505) (← links)
- Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
- Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093) (← links)
- Two forbidden induced subgraphs and well-quasi-ordering (Q2275404) (← links)
- Sandwiches missing two ingredients of order four (Q2288872) (← links)
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
