A classification of 1-well-covered graphs
From MaRDI portal
Publication:5097748
DOI10.3906/mat-2105-45zbMath1494.05083OpenAlexW4256022885MaRDI QIDQ5097748
Publication date: 1 September 2022
Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3906/mat-2105-45
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- Very well covered graphs
- On \(\alpha^{+}\)-stable König-Egerváry graphs
- Well-covered claw-free graphs
- Critical independent sets and König-Egerváry graphs
- 1-well-covered graphs revisited
- Efficient recognition of equimatchable graphs
- Edge-stable equimatchable graphs
- Node-weighted graphs having the König-Egerváry property
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- Complexity results for well‐covered graphs
- On some subclasses of well-covered graphs
- A class of planar well‐covered graphs with girth four
- Some covering concepts in graphs
This page was built for publication: A classification of 1-well-covered graphs
