Some covering concepts in graphs

Cited in

(only showing first 100 items - show all)

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
The structure of well-covered graphs and the complexity of their recognition problems
Recursively decomposable well-covered graphs
Totally equimatchable graphs
Using maximality and minimality conditions to construct inequality chains
On well-covered triangulations. I
Well-located graphs: A collection of well-covered ones
Roots of independence polynomials of well covered graphs
W₂-graphs and shedding vertices
The roller-coaster conjecture revisited
Graphs vertex-partitionable into strong cliques
On well-covered Cartesian products
Graphs with the Erdős-Ko-Rado property
On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
Graph operations preserving \(W_{2}\)-property
Very well covered graphs
Well irredundant graphs
The cyclomatic number of a graph and its independence polynomial at - 1
On the Cartesian product of non well-covered graphs
Domination related parameters in the generalized lexicographic product of graphs
A class of graphs with a few well-covered members
Weighted well-covered graphs without cycles of lengths 5, 6 and 7
Partitions and well-coveredness: the graph sandwich problem
On well-covered direct products
Critical sets, crowns and local maximum independent sets
1-extendability of independent sets
On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
Maximum modulus of independence roots of graphs and trees
On the structure of 4-regular planar well-covered graphs
Graphs in which all maximal bipartite subgraphs have the same order
Badly-covered graphs
On the complexity of the independent set problem in triangle graphs
1-well-covered graphs revisited
Detecting strong cliques
Well-covered graphs without cycles of lengths 4, 5 and 6
Recognizing well covered graphs of families with special \(P _{4}\)-components
On graphs having maximal independent sets of exactly \(t\) distinct cardinalities
Reconfiguring dominating sets in some well-covered and other classes of graphs
Equistable simplicial, very well-covered, and line graphs
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
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
A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals
On weakly connected domination in graphs. II.
The structure of well-covered graphs with no cycles of length 4
On well-dominated graphs
Jet graphs
A glimpse to most of the old and new results on very well-covered graphs from the viewpoint of commutative algebra
On \(\alpha\)-excellent graphs
On the probe problem for (r, )-well-coveredness
Modeling k-coteries by well-covered 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
Well-covered triangulations. IV
An introduction to game domination in graphs
Graphs with maximal induced matchings of the same size
On equistable, split, CIS, and related classes of graphs
When is \(G^2\) a König-Egerváry graph?
On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7
Extending Berge's and Favaron's results about well-covered graphs
On CIS circulants
Independent protection in graphs
Independence polynomials of some compound graphs
WELL-COVERED GRAPHS: A SURVEY
Local maximum stable set greedoids stemming from very well-covered graphs
Uniformly dissociated graphs
Constructions for well-covered graphs
The well-covered dimension of products of graphs
Vertex-transitive CIS graphs
Triangulations and equality in the domination chain
A characterization of Zm-well-covered graphs of girth 6 or more
Unimodality of the independence polynomials of some composite graphs
The minimum number of vertices of graphs containing two monochromatic triangles for any edge \(2\)-coloring
On graphs admitting two disjoint maximum independent sets
Cohen-Macaulayness of saturation of the second power of edge ideals
scientific article; zbMATH DE number 7639920 (Why is no real title available?)
A classification of 1-well-covered graphs
Crowns in bipartite graphs
scientific article; zbMATH DE number 7308162 (Why is no real title available?)
Cohen-Macaulay graphs with large girth
On well-covered pentagonalizations of the plane
The Clique Corona Operation and Greedoids
Recognizing generating subgraphs revisited
Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets
On the location of roots of independence polynomials
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\)
Critical equimatchable graphs
Well-covered circulant graphs
On local maximum stable set greedoids
Distinct sizes of maximal independent sets on graphs with restricted girth
A general formula for the index of depth stability of edge ideals
Well \textit{ve}-covered graphs

This page was built for publication: Some covering concepts in graphs

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