scientific article; zbMATH DE number 3614795

Cited in

(52)

The uniformity space of hypergraphs and its applications
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
Graphs vertex-partitionable into strong cliques
On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
Very well covered graphs
Weighted well-covered graphs without cycles of lengths 5, 6 and 7
Partitions and well-coveredness: the graph sandwich problem
Well-hued graphs
1-extendability of independent sets
On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
Graphs in which all maximal bipartite subgraphs have the same order
Domination, eternal domination, and clique covering
Well-covered graphs without cycles of lengths 4, 5 and 6
Extremal graphs for a new upper bound on domination parameters in graphs
A note on graphs contraction-critical with respect to independence number
On the roots of independence polynomials of almost all very well-covered graphs
Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type
Well-covered graphs and factors
Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
On \(\alpha\)-excellent graphs
On the probe problem for (r, )-well-coveredness
On well-covered, vertex decomposable and Cohen-Macaulay graphs
On the (parameterized) complexity of recognizing well-covered (r,)-graphs
Well-covered triangulations. IV
Graphs with maximal induced matchings of the same size
When is \(G^2\) a König-Egerváry graph?
Extending Berge's and Favaron's results about well-covered graphs
Independent protection in graphs
Matchings, coverings, and Castelnuovo-Mumford regularity
A class of planar well‐covered graphs with girth four
Local maximum stable set greedoids stemming from very well-covered graphs
Constructions for well-covered graphs
Weighted well-covered claw-free graphs
scientific article; zbMATH DE number 7308162 (Why is no real title available?)
The Clique Corona Operation and Greedoids
On average lower independence and domination numbers in graphs
Recognizing generating subgraphs revisited
Neighborhood unions and regularity in graphs
Path spectra for trees
Recognizing well-dominated graphs is coNP-complete
1-extendability of independent sets
Computing well-covered vector spaces of graphs using modular decomposition
Well-covered graphs with constraints on \(\Delta\) and \(\delta\)
Distinct sizes of maximal independent sets on graphs with restricted girth
Regular edges, matchings and Hilbert series
Independence polynomials of graphs with given cover number or dominate number
Beyond recognizing well-covered graphs
Generating subgraphs in chordal graphs
Complexity results for generating subgraphs
Mind the independence gap

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4179024)