The following pages link to WELL-COVERED GRAPHS: A SURVEY (Q4288045):
Displaying 50 items.
- A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals (Q256536) (← links)
- Well-covered triangulations. IV (Q323041) (← links)
- On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7 (Q389981) (← links)
- Extending Berge's and Favaron's results about well-covered graphs (Q394212) (← links)
- On CIS circulants (Q394314) (← links)
- Vertex-transitive CIS graphs (Q472401) (← 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)
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) (Q738850) (← links)
- Mind the independence gap (Q776261) (← links)
- Building graphs whose independence polynomials have only real roots (Q844224) (← 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 uniformity space of hypergraphs and its applications (Q1301700) (← links)
- The structure of well-covered graphs and the complexity of their recognition problems (Q1354731) (← links)
- Recursively decomposable well-covered graphs (Q1356429) (← links)
- Totally equimatchable graphs (Q1356717) (← links)
- On well-covered triangulations. I (Q1414586) (← links)
- Well-located graphs: A collection of well-covered ones (Q1422424) (← links)
- Roots of independence polynomials of well covered graphs (Q1577528) (← links)
- A characterization of well-covered graphs in terms of forbidden costable subgraphs (Q1581458) (← links)
- Refinement of the equilibrium of public goods games over networks: efficiency and effort of specialized equilibria (Q1633669) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- On well-covered Cartesian products (Q1756093) (← links)
- Well irredundant graphs (Q1917235) (← links)
- On 4-connected claw-free well-covered graphs (Q1917239) (← links)
- On the Cartesian product of non well-covered graphs (Q1953503) (← links)
- Independent transversals of hypergraph edges and bipartite bigraphs (Q1974346) (← links)
- The \(v\)-number of edge ideals (Q2005190) (← links)
- The size of Betti tables of edge ideals of clique corona graphs (Q2140596) (← links)
- New results relating independence and matchings (Q2151222) (← links)
- Well-hued graphs (Q2166254) (← links)
- On the structure of 4-regular planar well-covered graphs (Q2192121) (← links)
- On Gorenstein graphs (Q2240742) (← links)
- A revision and extension of results on 4-regular, 4-connected, claw-free graphs (Q2275929) (← links)
- Detecting strong cliques (Q2312812) (← links)
- Well-covered graphs without cycles of lengths 4, 5 and 6 (Q2345607) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- Edge-stable equimatchable graphs (Q2414461) (← links)
- A note on graphs contraction-critical with respect to independence number (Q2449144) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type (Q2481813) (← links)
- Well-covered graphs and factors (Q2492219) (← links)
- On weakly connected domination in graphs. II. (Q2581406) (← links)
- The structure of well-covered graphs with no cycles of length 4 (Q2643318) (← links)
