The following pages link to Well-covered claw-free graphs (Q1924128):
Displaying 36 items.
- It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
- Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222) (← links)
- Well-covered triangulations. IV (Q323041) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Extending Berge's and Favaron's results about well-covered graphs (Q394212) (← links)
- Weighted well-covered claw-free graphs (Q482209) (← links)
- On well-covered pentagonalizations of the plane (Q526819) (← links)
- Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) (Q628320) (← links)
- Complexity results for generating subgraphs (Q724239) (← links)
- The well-covered dimension of random graphs (Q864120) (← links)
- On well-covered triangulations. II. (Q967322) (← links)
- On well-covered triangulations. III (Q972324) (← links)
- Greedily constructing maximal partial \(f\)-factors (Q1025473) (← links)
- The structure of well-covered graphs and the complexity of their recognition problems (Q1354731) (← links)
- On well-covered triangulations. I (Q1414586) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- 1-extendability of independent sets (Q2169951) (← links)
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
- Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 (Q2192076) (← links)
- On the structure of 4-regular planar well-covered graphs (Q2192121) (← links)
- Well-covered graphs without cycles of lengths 4, 5 and 6 (Q2345607) (← links)
- On relating edges in graphs without cycles of length 4 (Q2447533) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6 (Q3655148) (← links)
- (Q4622618) (← links)
- A classification of 1-well-covered graphs (Q5097748) (← links)
- The Clique Corona Operation and Greedoids (Q5505676) (← links)
- Recognizing Generating Subgraphs Revisited (Q5859675) (← links)
- Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)
- 1-extendability of independent sets (Q6119830) (← links)
- Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)
- Well-covered graphs with constraints on \(\Delta\) and \(\delta\) (Q6185607) (← links)
- Recognizing \(\text{W}_2\) graphs (Q6580488) (← links)
