\(W_2\)-graphs and shedding vertices

DOI10.1016/j.endm.2017.07.038zbMath1378.05155OpenAlexW2742680891MaRDI QIDQ1690016

Vadim E. Levit, Eugen Mandrescu

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.07.038

zbMATH Keywords

matchingmaximum independent setwell-covered graph1-well-covered graphdifferential of a setshedding vertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Graph operations preserving \(W_{2}\)-property ⋮ 1-well-covered graphs revisited

Cites Work

• A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals
• On well-covered, vertex decomposable and Cohen-Macaulay graphs
• Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
• Chordal and sequentially Cohen-Macaulay clutters
• Lower bounds on the differential of a graph
• Algebraic properties of edge ideals via combinatorial topology
• A characterization of well covered graphs of girth 5 or greater
• Cohen-Macaulay bipartite graphs
• Edge-stable equimatchable graphs
• Vertex decomposable graphs and obstructions to shellability
• On some subclasses of well-covered graphs
• Well covered simplicial, chordal, and circular arc graphs
• Cohen–Macaulay graphs with large girth
• Some covering concepts in graphs
• Independence Complexes of Well-Covered Circulant Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(W_2\)-graphs and shedding vertices