The following pages link to (Q5365068):
Displaying 26 items.
- Weighted well-covered claw-free graphs (Q482209) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093) (← links)
- Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs (Q1709548) (← 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)
- Separation routine and extended formulations for the stable set problem in claw-free graphs (Q2039230) (← 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)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Efficient recognition of equimatchable graphs (Q2350604) (← links)
- A note on the Cornaz-Jost transformation to solve the graph coloring problem (Q2444903) (← links)
- A reduction algorithm for the weighted stable set problem in claw-free graphs (Q2448908) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- Domination When the Stars Are Out (Q3012826) (← links)
- Asymptotics of the chromatic number for quasi-line graphs (Q3503489) (← links)
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs (Q3503841) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- (Q5743477) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels (Q6080861) (← links)
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477) (← links)
- Packing \(K_r\)s in bounded degree graphs (Q6497939) (← links)
- Recognizing \(\text{W}_2\) graphs (Q6580488) (← links)
