WELL-COVERED GRAPHS: A SURVEY
From MaRDI portal
Publication:4288045
DOI10.1080/16073606.1993.9631737zbMath0817.05068OpenAlexW2014871086WikidataQ56210383 ScholiaQ56210383MaRDI QIDQ4288045
Publication date: 21 April 1994
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/16073606.1993.9631737
Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)
Related Items
Refinement of the equilibrium of public goods games over networks: efficiency and effort of specialized equilibria ⋮ Recognizing well covered graphs of families with special \(P _{4}\)-components ⋮ The size of Betti tables of edge ideals of clique corona graphs ⋮ Building graphs whose independence polynomials have only real roots ⋮ The structure of well-covered graphs and the complexity of their recognition problems ⋮ Well-covered triangulations. IV ⋮ Recursively decomposable well-covered graphs ⋮ Totally equimatchable graphs ⋮ New results relating independence and matchings ⋮ The structure of well-covered graphs with no cycles of length 4 ⋮ The well-covered dimension of random graphs ⋮ Buchsbaumness of the second powers of edge ideals ⋮ Well-hued graphs ⋮ Well irredundant graphs ⋮ On 4-connected claw-free well-covered graphs ⋮ On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7 ⋮ A glimpse to most of the old and new results on very well-covered graphs from the viewpoint of commutative algebra ⋮ Edge-stable equimatchable graphs ⋮ Extending Berge's and Favaron's results about well-covered graphs ⋮ On CIS circulants ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ On the structure of 4-regular planar well-covered graphs ⋮ On \(\alpha\)-excellent graphs ⋮ Strong cliques in vertex‐transitive graphs ⋮ Well-covered circulant graphs ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs ⋮ On well-covered triangulations. I ⋮ On the Cartesian product of non well-covered graphs ⋮ Graphs vertex-partitionable into strong cliques ⋮ Well-located graphs: A collection of well-covered ones ⋮ A note on graphs contraction-critical with respect to independence number ⋮ Vertex-transitive CIS graphs ⋮ Well-indumatched Trees and Graphs of Bounded Girth ⋮ Weighted well-covered claw-free graphs ⋮ Independent transversals of hypergraph edges and bipartite bigraphs ⋮ Triangulations and equality in the domination chain ⋮ Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids ⋮ On Gorenstein graphs ⋮ A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs ⋮ Cohen–Macaulay Circulant Graphs ⋮ Unnamed Item ⋮ On well-covered Cartesian products ⋮ On well-covered pentagonalizations of the plane ⋮ Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type ⋮ On well-covered triangulations. II. ⋮ The \(v\)-number of edge ideals ⋮ Independence Complexes of Well-Covered Circulant Graphs ⋮ On well-covered triangulations. III ⋮ Neighborhood unions and regularity in graphs ⋮ Well-covered graphs and factors ⋮ A revision and extension of results on 4-regular, 4-connected, claw-free graphs ⋮ Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) ⋮ Well-totally-dominated graphs ⋮ Greedily constructing maximal partial \(f\)-factors ⋮ Detecting strong cliques ⋮ Mind the independence gap ⋮ Roots of independence polynomials of well covered graphs ⋮ Unnamed Item ⋮ A characterization of well-covered graphs in terms of forbidden costable subgraphs ⋮ Unnamed Item ⋮ The Clique Corona Operation and Greedoids ⋮ The uniformity space of hypergraphs and its applications ⋮ Cohen–Macaulay graphs with large girth ⋮ On weakly connected domination in graphs. II. ⋮ Well-covered graphs without cycles of lengths 4, 5 and 6 ⋮ A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of the graphs in which the transversal number equals the matching number
- Ear-decompositions of matching-covered graphs
- On maximal independent sets of vertices in claw-free graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- A characterization of well covered graphs of girth 5 or greater
- Matching-perfect and cover-perfect graphs
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Well-covered graphs and extendability
- Very well covered graphs
- On 4-connected claw-free well-covered graphs
- Cyclic coloration of 3-polytopes
- Complexity results for well‐covered graphs
- Matchings in polytopal graphs
- Regularisable Graphs
- On some subclasses of well-covered graphs
- Recognizing Greedy Structures
- A Theorem on k-Saturated Graphs
- Some covering concepts in graphs
- The Factorization of Linear Graphs
