Pages that link to "Item:Q1144589"
From MaRDI portal
The following pages link to Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé (Q1144589):
Displaying 50 items.
- On well-covered triangulations. I (Q1414586) (← links)
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem (Q1414587) (← links)
- Stable sets in two subclasses of banner-free graphs (Q1414588) (← links)
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs (Q1414592) (← links)
- Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- Stabex method for extension of \(\alpha\)-polynomial hereditary classes. (Q1427601) (← links)
- Stability in \(P_5\)- and banner-free graphs (Q1580977) (← links)
- On claw-free asteroidal triple-free graphs (Q1613398) (← links)
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← 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 stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs (Q1709548) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Correction to: ``A connection between sports and matroids: how many teams can we beat?'' (Q1755751) (← links)
- Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
- Sparse regular induced subgraphs in \(2P_3\)-free graphs (Q1799386) (← links)
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148) (← links)
- Independent sets of maximum weight in (\(p,q\))-colorable graphs. (Q1874371) (← links)
- Polynomially solvable cases for the maximum stable set problem (Q1894362) (← links)
- Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs (Q1920760) (← links)
- Maximum independent sets near the upper bound (Q2026337) (← 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)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
- Coloring graph classes with no induced fork via perfect divisibility (Q2161205) (← links)
- The limits of local search for weighted \(k\)-set packing (Q2164726) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- On the structure of 4-regular planar well-covered graphs (Q2192121) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
- Extending the MAX algorithm for maximum independent set (Q2344024) (← links)
- New sufficient conditions for \(\alpha\)-redundant vertices (Q2346329) (← links)
- The maximum independent set problem in subclasses of subcubic graphs (Q2346341) (← links)
- The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
- On the vertex packing problem (Q2366214) (← links)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Claw-free strictly Deza graphs (Q2403679) (← links)
- From matchings to independent sets (Q2403787) (← links)
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs (Q2410110) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- A note on graphs contraction-critical with respect to independence number (Q2449144) (← links)
- Augmenting chains in graphs without a skew star. (Q2490836) (← links)
