Edge-stable equimatchable graphs
From MaRDI portal
Publication:2414461
DOI10.1016/j.dam.2018.09.033zbMath1410.05162arXiv1602.09127OpenAlexW2962874356WikidataQ128983566 ScholiaQ128983566MaRDI QIDQ2414461
Publication date: 17 May 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.09127
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (max. 100)
A classification of 1-well-covered graphs ⋮ \(W_2\)-graphs and shedding vertices ⋮ Unnamed Item ⋮ 1-well-covered graphs revisited ⋮ Edge-Critical Equimatchable Bipartite Graphs ⋮ Equimatchable bipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
- Bounding the size of equimatchable graphs of fixed genus
- Matching theory
- Equimatchable claw-free graphs
- 1-well-covered graphs revisited
- Efficient recognition of equimatchable graphs
- Hardness and approximation of minimum maximal matchings
- Vertex decomposable graphs and obstructions to shellability
- Equimatchable Graphs on Surfaces
- Edge Dominating Sets in Graphs
- Complexity results for well‐covered graphs
- On some subclasses of well-covered graphs
- Randomly matchable graphs
- WELL-COVERED GRAPHS: A SURVEY
- A class of planar well‐covered graphs with girth four
- On Minimum Maximal Distance-k Matchings
- Buchsbaumness of the second powers of edge ideals
- Equimatchable Regular Graphs
- Equimatchable factor‐critical graphs
- Algorithms – ESA 2004
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: Edge-stable equimatchable graphs
