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):
Displayed 50 items.
- 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)
- On balanced graphs (Q2583124) (← links)
- Combinatorics and algorithms for augmenting graphs (Q2631076) (← links)
- On the complexity of colouring antiprismatic graphs (Q2659773) (← links)
- On the facets of stable set polytopes of circular interval graphs (Q2673814) (← links)
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
- On weights of induced paths and cycles in claw-free andK1,r-free graphs (Q2712590) (← links)
- Independent Sets in Classes Related to Chair-Free Graphs (Q2795949) (← links)
- Independent Set Reconfiguration in Cographs and their Generalizations (Q2825488) (← links)
- Lovász-Schrijver PSD-Operator on Claw-Free Graphs (Q2835662) (← links)
- A Note on the Minimum H-Subgraph Edge Deletion (Q2947962) (← links)
- Domination When the Stars Are Out (Q3012826) (← links)
- Independent sets in graphs without subtrees with many leaves (Q3186851) (← links)
- On Some Properties of the Struction of a Graph (Q3328582) (← links)
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs (Q3503841) (← links)
- The Maximum Independent Set Problem in Planar Graphs (Q3599118) (← links)
- WELL-COVERED GRAPHS: A SURVEY (Q4288045) (← links)
- Colouring Squares of Claw-free Graphs (Q4625179) (← links)
- Polynomial algorithm for finding the largest independent sets in graphs without forks (Q4936659) (← links)
- Approximating Incremental Combinatorial Optimization Problems (Q5002607) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- A survey on graphs with convex quadratic stability number (Q5207733) (← links)
- Enumeration of Maximal Irredundant Sets for Claw-Free Graphs (Q5283376) (← links)
- Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
- (Q5708520) (← links)
- (Q5874504) (← links)
- A Polynomial Kernel for Line Graph Deletion (Q5874512) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
- On a classification of independence systems (Q5902624) (← links)
- Hard graphs for the maximum clique problem (Q5903783) (← links)
- On the relation of strong triadic closure and cluster deletion (Q5915591) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
- Hard and easy instances of L-tromino tilings (Q5919532) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6039437) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- (Q6078549) (← links)
- Domination number and feedback vertex number of complements of line graphs (Q6101458) (← links)
- Counterexamples to the characterisation of graphs with equal independence and annihilation number (Q6117243) (← links)
- A polytime preprocess algorithm for the maximum independent set problem (Q6151535) (← links)
- Efficiently recognizing graphs with equal independence and annihilation numbers (Q6161447) (← links)