Very well covered graphs
From MaRDI portal
Publication:1837211
Cites work
Cited in
(57)- Well-covered graphs and extendability
- A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets
- Strongly well-covered graphs
- Recursively decomposable well-covered graphs
- The roller-coaster conjecture revisited
- Graphs vertex-partitionable into strong cliques
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
- Shedding vertices of vertex decomposable well-covered graphs
- The cyclomatic number of a graph and its independence polynomial at - 1
- Partitions and well-coveredness: the graph sandwich problem
- On well-covered direct products
- Very well-covered graphs and local cohomology of their residue rings by the edge ideals
- Critical sets, crowns and local maximum independent sets
- Well-hued graphs
- Maximum modulus of independence roots of graphs and trees
- 1-well-covered graphs revisited
- Well-covered graphs without cycles of lengths 4, 5 and 6
- Equistable simplicial, very well-covered, and line graphs
- On the roots of independence polynomials of almost all very well-covered graphs
- Well-covered graphs and factors
- Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
- Depth and regularity modulo a principal ideal
- Jet graphs
- A glimpse to most of the old and new results on very well-covered graphs from the viewpoint of commutative algebra
- Modeling k-coteries by well-covered graphs
- A note on Cohen-Macaulay graphs
- On the (parameterized) complexity of recognizing well-covered (r,)-graphs
- Very well-covered graphs of girth at least four and local maximum stable set greedoids
- Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs
- An introduction to game domination in graphs
- When is \(G^2\) a König-Egerváry graph?
- Extending Berge's and Favaron's results about well-covered graphs
- A set and collection lemma
- Matchings, coverings, and Castelnuovo-Mumford regularity
- WELL-COVERED GRAPHS: A SURVEY
- Local maximum stable set greedoids stemming from very well-covered graphs
- Weighted well-covered claw-free graphs
- A characterization of Zm-well-covered graphs of girth 6 or more
- A classification of 1-well-covered graphs
- Crowns in bipartite graphs
- Very well-covered graphs and their h-vectors
- The Clique Corona Operation and Greedoids
- Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs
- On the Castelnuovo-Mumford regularity of squarefree powers of edge ideals
- Recognizing well-dominated graphs is coNP-complete
- Gorenstein homogeneous subrings of graphs
- Very well-covered graphs by Betti splittings
- Computing well-covered vector spaces of graphs using modular decomposition
- Very well-covered graphs via the Rees algebra
- On local maximum stable set greedoids
- 1-well-covered graphs containing a clique of size \(n/3\)
- Regular edges, matchings and Hilbert series
- Jets and principal components of monomial ideals and very well-covered graphs
- The v-numbers and linear presentations of ideals of covers of graphs
- Log-concavity of the independence polynomials of \(\mathbf{W}_p\) graphs
- Spheres and balls as independence complexes
- Building graphs whose independence polynomials have only real roots
This page was built for publication: Very well covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837211)
