Pages that link to "Item:Q1139605"
From MaRDI portal
The following pages link to On maximal independent sets of vertices in claw-free graphs (Q1139605):
Displaying 50 items.
- Augmenting approach for some maximum set problems (Q284765) (← links)
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (Q290201) (← links)
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
- The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs (Q322186) (← links)
- Well-covered triangulations. IV (Q323041) (← links)
- Tent and a subclass of \(P_{5}\)-free graphs (Q327628) (← 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)
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- A note on anti-coordination and social interactions (Q386417) (← 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)
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems (Q445938) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Weighted well-covered claw-free graphs (Q482209) (← links)
- On well-covered pentagonalizations of the plane (Q526819) (← links)
- On the facets of the stable set polytope of quasi-line graphs (Q635515) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← 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)
- Augmenting graphs for independent sets (Q705491) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Cycles of given length in some \(K_{1,3}\)-free graphs (Q749554) (← links)
- Stability in CAN-free graphs (Q762505) (← links)
- A dichotomy in the complexity of consistent query answering for queries with two atoms (Q763497) (← links)
- Mind the independence gap (Q776261) (← links)
- Grundy dominating sequences on \(X\)-join product (Q777371) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← 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)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← 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)
- On finding augmenting graphs (Q955317) (← links)
- On well-covered triangulations. II. (Q967322) (← links)
- On well-covered triangulations. III (Q972324) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- On packing shortest cycles in graphs (Q989491) (← links)
- Gear composition and the stable set polytope (Q1003487) (← links)
- Finding augmenting chains in extensions of claw-free graphs (Q1007635) (← links)
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← 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)
