Pages that link to "Item:Q3993632"
From MaRDI portal
The following pages link to Complexity results for well‐covered graphs (Q3993632):
Displaying 50 items.
- 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)
- On CIS circulants (Q394314) (← links)
- Weighted well-covered claw-free graphs (Q482209) (← links)
- Triangulations and equality in the domination chain (Q494427) (← links)
- On well-covered pentagonalizations of the plane (Q526819) (← links)
- Well-covered circulant graphs (Q626761) (← links)
- Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) (Q628320) (← links)
- Complexity results for generating subgraphs (Q724239) (← links)
- Mind the independence gap (Q776261) (← links)
- Satgraphs and independent domination. I (Q818113) (← links)
- On well-covered triangulations. II. (Q967322) (← links)
- On well-covered triangulations. III (Q972324) (← links)
- On the well-coveredness of Cartesian products of graphs (Q998514) (← links)
- Greedily constructing maximal partial \(f\)-factors (Q1025473) (← links)
- Well-covered graphs and extendability (Q1318795) (← links)
- The structure of well-covered graphs and the complexity of their recognition problems (Q1354731) (← links)
- Recursively decomposable well-covered graphs (Q1356429) (← links)
- On well-covered triangulations. I (Q1414586) (← links)
- A characterization of well-covered graphs in terms of forbidden costable subgraphs (Q1581458) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- On 4-connected claw-free well-covered graphs (Q1917239) (← links)
- Weighted well-covered graphs without cycles of lengths 5, 6 and 7 (Q2059877) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- Well-hued graphs (Q2166254) (← 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)
- Detecting strong cliques (Q2312812) (← links)
- Well-covered graphs without cycles of lengths 4, 5 and 6 (Q2345607) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- Well-dominated graphs without cycles of lengths 4 and 5 (Q2397523) (← links)
- Edge-stable equimatchable graphs (Q2414461) (← links)
- On relating edges in graphs without cycles of length 4 (Q2447533) (← links)
- Well-covered graphs and factors (Q2492219) (← links)
- The structure of well-covered graphs with no cycles of length 4 (Q2643318) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
- ModelingK-coteries by well-covered graphs (Q2766106) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS (Q3087098) (← links)
- WELL-COVERED GRAPHS: A SURVEY (Q4288045) (← links)
- (Q4622618) (← links)
- A characterization of Zm-well-covered graphs of girth 6 or more (Q4948753) (← links)
- A classification of 1-well-covered graphs (Q5097748) (← links)
- The Clique Corona Operation and Greedoids (Q5505676) (← links)
- Recognizing Generating Subgraphs Revisited (Q5859675) (← links)
