WELL-COVERED GRAPHS: A SURVEY
From MaRDI portal
Publication:4288045
Recommendations
Cites work
- scientific article; zbMATH DE number 68351 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3241107 (Why is no real title available?)
- A Theorem on k-Saturated Graphs
- A characterization of the graphs in which the transversal number equals the matching number
- A characterization of well covered graphs of girth 5 or greater
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Complexity results for well‐covered graphs
- Cyclic coloration of 3-polytopes
- Ear-decompositions of matching-covered graphs
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Matching-perfect and cover-perfect graphs
- Matchings in polytopal graphs
- On 4-connected claw-free well-covered graphs
- On maximal independent sets of vertices in claw-free graphs
- On some subclasses of well-covered graphs
- Recognizing Greedy Structures
- Regularisable Graphs
- Some covering concepts in graphs
- The Factorization of Linear Graphs
- Very well covered graphs
- Well-covered graphs and extendability
Cited in
(85)- Refinement of the equilibrium of public goods games over networks: efficiency and effort of specialized equilibria
- On well-covered Cartesian products
- Triangulations and equality in the domination chain
- A characterization of well-covered graphs in terms of forbidden costable subgraphs
- Building graphs whose independence polynomials have only real roots
- On well-covered triangulations. I
- Independent transversals of hypergraph edges and bipartite bigraphs
- Extending Berge's and Favaron's results about well-covered graphs
- Cohen-Macaulay circulant graphs
- The \(v\)-number of edge ideals
- Well-indumatched Trees and Graphs of Bounded Girth
- Strongly well-covered graphs
- Mind the independence gap
- scientific article; zbMATH DE number 1472162 (Why is no real title available?)
- On 4-connected claw-free well-covered graphs
- Edge-stable equimatchable graphs
- Cohen-Macaulay graphs with large girth
- On the Cartesian product of non well-covered graphs
- Roots of independence polynomials of well covered graphs
- scientific article; zbMATH DE number 4191722 (Why is no real title available?)
- A glimpse to most of the old and new results on very well-covered graphs from the viewpoint of commutative algebra
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- The structure of well-covered graphs with no cycles of length 4
- Graphs vertex-partitionable into strong cliques
- On well-covered triangulations. II.
- On well-covered triangulations. III
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
- Totally equimatchable graphs
- On Gorenstein graphs
- Well-located graphs: A collection of well-covered ones
- Independence complexes of well-covered circulant graphs
- Complexity results for well‐covered graphs
- On CIS circulants
- Detecting strong cliques
- Well-totally-dominated graphs
- Modeling \(k\)-coteries by well-covered graphs
- The well-covered dimension of random graphs
- A revision and extension of results on 4-regular, 4-connected, claw-free graphs
- On the structure of 4-regular planar well-covered graphs
- A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals
- Well irredundant graphs
- The uniformity space of hypergraphs and its applications
- Graph operations on weakly well covered graphs
- The structure of well-covered graphs and the complexity of their recognition problems
- scientific article; zbMATH DE number 7308162 (Why is no real title available?)
- Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type
- Well-covered triangulations. IV
- Well-covered circulant graphs
- Well covered simplicial, chordal, and circular arc graphs
- Weighted well-covered claw-free graphs
- On well-covered pentagonalizations of the plane
- On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7
- The Clique Corona Operation and Greedoids
- Greedily constructing maximal partial \(f\)-factors
- scientific article; zbMATH DE number 205349 (Why is no real title available?)
- Vertex-transitive CIS graphs
- Recursively decomposable well-covered graphs
- Pure simplicial complexes and well-covered graphs
- Well-covered graphs without cycles of lengths 4, 5 and 6
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs
- On weakly connected domination in graphs. II.
- Strong cliques in vertex‐transitive graphs
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
- New results relating independence and matchings
- The size of Betti tables of edge ideals of clique corona graphs
- scientific article; zbMATH DE number 7639920 (Why is no real title available?)
- Computing well-covered vector spaces of graphs using modular decomposition
- Some covering by monochromatic paths concepts in graphs
- Well-covered unitary Cayley graphs of matrix rings over finite fields and applications
- Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs
- Well-forced graphs
- Graphs in which all maximal bipartite subgraphs have the same order
- Comparing subclasses of well-covered graphs
- Some operations of graphs that preserve the property of well-covered by monochromatic paths
- A note on graphs contraction-critical with respect to independence number
- Stability, domination, and irredundance in \(W_{AR}\) graphs
- Distinct sizes of maximal independent sets on graphs with restricted girth
- On \(\alpha\)-excellent graphs
- Neighborhood unions and regularity in graphs
- Buchsbaumness of the second powers of edge ideals
- Well-covered graphs and factors
- Constructions for well-covered graphs
- A general formula for the index of depth stability of edge ideals
- Well-hued graphs
- Recognizing well-dominated graphs is coNP-complete
This page was built for publication: WELL-COVERED GRAPHS: A SURVEY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288045)
