Pages that link to "Item:Q4483540"

The following pages link to A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH (Q4483540):

Displaying 50 items.

• A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
• The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect (Q403365) (← links)
• On the recognition of fuzzy circular interval graphs (Q408180) (← links)
• Coloring fuzzy circular interval graphs (Q412282) (← links)
• Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
• Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
• On minimal prime extensions of a four-vertex graph in a prime graph (Q704276) (← links)
• Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
• Penta-extensions of hereditary classes of graphs (Q813334) (← links)
• On the feedback vertex set polytope of a series-parallel graph (Q834183) (← links)
• On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
• Tight results on minimum entropy set cover (Q926288) (← links)
• Clique-circulants and the stable set polytope of fuzzy circular interval graphs (Q948961) (← links)
• The stable set polytope of quasi-line graphs (Q949780) (← links)
• Finding augmenting chains in extensions of claw-free graphs (Q1007635) (← links)
• Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs (Q1041408) (← links)
• Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← links)
• Colouring squares of claw-free graphs (Q1689990) (← 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)
• Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
• Maximum colorful independent sets in vertex-colored graphs (Q1792109) (← links)
• Sparse regular induced subgraphs in \(2P_3\)-free graphs (Q1799386) (← links)
• Independent sets of maximum weight in (\(p,q\))-colorable graphs. (Q1874371) (← links)
• Separation routine and extended formulations for the stable set problem in claw-free graphs (Q2039230) (← links)
• Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time (Q2043008) (← 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)
• The limits of local search for weighted \(k\)-set packing (Q2164726) (← links)
• On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
• The complexity of dissociation set problems in graphs (Q2275943) (← links)
• Integer round-up property for the chromatic number of some \(h\)-perfect graphs (Q2364493) (← links)
• Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
• A reduction algorithm for the weighted stable set problem in claw-free graphs (Q2448908) (← links)
• Minimum cost and list homomorphisms to semicomplete digraphs (Q2492190) (← links)
• Combinatorics and algorithms for augmenting graphs (Q2631076) (← links)
• On the facets of stable set polytopes of circular interval graphs (Q2673814) (← links)
• Domination When the Stars Are Out (Q3012826) (← links)
• Squares of Intersection Graphs and Induced Matchings (Q3439440) (← 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)
• Colouring Squares of Claw-free Graphs (Q4625179) (← links)
• Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
• Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
• Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
• (Q5708520) (← links)
• (Q5743477) (← links)
• A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
• Hard and easy instances of L-tromino tilings (Q5919532) (← links)