Pages that link to "Item:Q4936659"

The following pages link to Polynomial algorithm for finding the largest independent sets in graphs without forks (Q4936659):

Displaying 22 items.

• Classes of perfect graphs (Q2433714) (← links)
• Boundary properties of the satisfiability problems (Q2450928) (← links)
• Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs (Q2463465) (← links)
• Augmenting chains in graphs without a skew star. (Q2490836) (← links)
• Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
• The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs (Q3181049) (← links)
• Independent sets in graphs without subtrees with many leaves (Q3186851) (← links)
• On the number of boundary classes in the 3-colouring problem (Q3225901) (← links)
• Squares of Intersection Graphs and Induced Matchings (Q3439440) (← links)
• Solving Problems on Graphs of High Rank-Width (Q3449829) (← 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)
• Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems (Q4713055) (← links)
• (Q5874491) (← links)
• (Q5874504) (← links)
• A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
• Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
• An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)
• Counting independent sets in graphs with bounded bipartite pathwidth (Q6074656) (← links)
• New cases of polynomial solvability of the independent set problem for graphs with forbidden triods (Q6078549) (← links)
• (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth (Q6080868) (← links)
• Independent transversals versus transversals (Q6621186) (← links)