Pages that link to "Item:Q1765375"

The following pages link to Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375):

Displaying 33 items.

• A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
• A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
• Maximum weight independent sets in classes related to claw-free graphs (Q344862) (← links)
• A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
• The cluster deletion problem for cographs (Q394219) (← links)
• Independent sets in graphs (Q501998) (← links)
• Critical hereditary graph classes: a survey (Q518125) (← links)
• Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
• Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
• Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
• The induced separation dimension of a graph (Q722529) (← links)
• Polar graphs and maximal independent sets (Q860455) (← links)
• Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
• On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
• Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093) (← links)
• Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
• Sparse regular induced subgraphs in \(2P_3\)-free graphs (Q1799386) (← 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)
• Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
• On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
• Independent domination versus weighted independent domination (Q2294440) (← links)
• Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
• Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
• From matchings to independent sets (Q2403787) (← links)
• Independent Sets in Classes Related to Chair-Free Graphs (Q2795949) (← links)
• The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs (Q3181049) (← links)
• Induced Separation Dimension (Q3181052) (← links)
• The Maximum Independent Set Problem in Planar Graphs (Q3599118) (← links)
• New Cases of the Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Paths (Q4558286) (← links)
• On Toughness and Hamiltonicity of 2<i>K</i>₂‐Free Graphs (Q5417820) (← links)
• A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
• (Q6078549) (← links)