Some covering concepts in graphs
From MaRDI portal
Publication:5591382
DOI10.1016/S0021-9800(70)80011-4zbMath0195.25801OpenAlexW2131158880MaRDI QIDQ5591382
Publication date: 1970
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(70)80011-4
Related Items
Recognizing well-dominated graphs is coNP-complete ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ Well-covered graphs with constraints on \(\Delta\) and \(\delta\) ⋮ Unnamed Item ⋮ 1-extendability of independent sets ⋮ Strongly well-covered graphs ⋮ Recognizing well covered graphs of families with special \(P _{4}\)-components ⋮ On graphs having maximal independent sets of exactly \(t\) distinct cardinalities ⋮ Building graphs whose independence polynomials have only real roots ⋮ On graphs admitting two disjoint maximum independent sets ⋮ The structure of well-covered graphs and the complexity of their recognition problems ⋮ Well-covered triangulations. IV ⋮ Critical sets, crowns and local maximum independent sets ⋮ Recursively decomposable well-covered graphs ⋮ Totally equimatchable graphs ⋮ The structure of well-covered graphs with no cycles of length 4 ⋮ WELL-COVERED GRAPHS: A SURVEY ⋮ Graphs with maximal induced matchings of the same size ⋮ On equistable, split, CIS, and related classes of graphs ⋮ The well-covered dimension of random graphs ⋮ Reconfiguring dominating sets in some well-covered and other classes of graphs ⋮ On well-dominated graphs ⋮ On the location of roots of independence polynomials ⋮ 1-extendability of independent sets ⋮ Well irredundant graphs ⋮ When is \(G^2\) a König-Egerváry graph? ⋮ On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity ⋮ Using maximality and minimality conditions to construct inequality chains ⋮ Maximum modulus of independence roots of graphs and trees ⋮ Jet graphs ⋮ A characterization of Zm-well-covered graphs of girth 6 or more ⋮ On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7 ⋮ A glimpse to most of the old and new results on very well-covered graphs from the viewpoint of commutative algebra ⋮ Extending Berge's and Favaron's results about well-covered graphs ⋮ On CIS circulants ⋮ A classification of 1-well-covered graphs ⋮ Independent protection in graphs ⋮ \(W_2\)-graphs and shedding vertices ⋮ On the structure of 4-regular planar well-covered graphs ⋮ Independence polynomials of some compound graphs ⋮ On \(\alpha\)-excellent graphs ⋮ On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs ⋮ Well-covered circulant graphs ⋮ The roller-coaster conjecture revisited ⋮ Uniformly dissociated graphs ⋮ On the probe problem for \((r,\ell )\)-well-coveredness ⋮ The cyclomatic number of a graph and its independence polynomial at \(- 1\) ⋮ On well-covered triangulations. I ⋮ On the Cartesian product of non well-covered graphs ⋮ Local maximum stable set greedoids stemming from very well-covered graphs ⋮ Graphs vertex-partitionable into strong cliques ⋮ Well-located graphs: A collection of well-covered ones ⋮ Graphs in which all maximal bipartite subgraphs have the same order ⋮ On the order of uniquely (k,m)-colourable graphs ⋮ ModelingK-coteries by well-covered graphs ⋮ Unnamed Item ⋮ Equistable simplicial, very well-covered, and line graphs ⋮ The well-covered dimension of products of graphs ⋮ Vertex-transitive CIS graphs ⋮ On local maximum stable set greedoids ⋮ Triangulations and equality in the domination chain ⋮ Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids ⋮ Cohen-Macaulayness of saturation of the second power of edge ideals ⋮ Crowns in bipartite graphs ⋮ On the roots of independence polynomials of almost all very well-covered graphs ⋮ Unnamed Item ⋮ On well-covered Cartesian products ⋮ On well-covered pentagonalizations of the plane ⋮ Badly-covered graphs ⋮ Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type ⋮ On well-covered triangulations. II. ⋮ On well-covered triangulations. III ⋮ Well-covered graphs and factors ⋮ Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture ⋮ Graphs with the Erdős-Ko-Rado property ⋮ On the complexity of the independent set problem in triangle graphs ⋮ On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph ⋮ Complexity results for generating subgraphs ⋮ Domination related parameters in the generalized lexicographic product of graphs ⋮ Graph operations preserving \(W_{2}\)-property ⋮ On the well-coveredness of Cartesian products of graphs ⋮ A class of graphs with a few well-covered members ⋮ An Introduction to Game Domination in Graphs ⋮ VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS ⋮ Weighted well-covered graphs without cycles of lengths 5, 6 and 7 ⋮ 1-well-covered graphs revisited ⋮ Detecting strong cliques ⋮ Roots of independence polynomials of well covered graphs ⋮ Very well covered graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Clique Corona Operation and Greedoids ⋮ Unimodality of the independence polynomials of some composite graphs ⋮ The uniformity space of hypergraphs and its applications ⋮ Cohen–Macaulay graphs with large girth ⋮ Recognizing Generating Subgraphs Revisited ⋮ On weakly connected domination in graphs. II. ⋮ Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets ⋮ Well-covered graphs without cycles of lengths 4, 5 and 6 ⋮ Well-covered graphs and extendability ⋮ Partitions and well-coveredness: the graph sandwich problem ⋮ A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets ⋮ A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals ⋮ On well-covered direct products
