A characterization of well covered graphs of girth 5 or greater
From MaRDI portal
Publication:1204485
DOI10.1006/jctb.1993.1005zbMath0777.05088OpenAlexW2036243565MaRDI QIDQ1204485
Bert L. Hartnell, Richard J. Nowakowski, Arthur S. Finbow
Publication date: 10 March 1993
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1993.1005
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items
Strongly well-covered graphs ⋮ On well-covered, vertex decomposable and Cohen-Macaulay 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 ⋮ Well-covered triangulations. IV ⋮ New results relating independence and matchings ⋮ The structure of well-covered graphs with no cycles of length 4 ⋮ \((C_3, C_4, C_5, C_7)\)-free almost well-dominated graphs ⋮ WELL-COVERED GRAPHS: A SURVEY ⋮ Graphs with maximal induced matchings of the same size ⋮ The well-covered dimension of random graphs ⋮ Buchsbaumness of the second powers of edge ideals ⋮ Well-dominated graphs without cycles of lengths 4 and 5 ⋮ Reconfiguring dominating sets in some well-covered and other classes of graphs ⋮ Well-hued graphs ⋮ On well-dominated graphs ⋮ On 4-connected claw-free well-covered graphs ⋮ 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 ⋮ 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 ⋮ Extending Berge's and Favaron's results about well-covered graphs ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity ⋮ \(W_2\)-graphs and shedding vertices ⋮ Gorenstein homogeneous subrings of graphs ⋮ Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 ⋮ On the structure of 4-regular planar well-covered graphs ⋮ Very well-covered graphs with the Erdős-Ko-Rado property ⋮ Well-covered circulant graphs ⋮ Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ Well-covered graphs with constraints on \(\Delta\) and \(\delta\) ⋮ On the unimodality of independence polynomials of very well-covered graphs ⋮ Uniformly dissociated graphs ⋮ On the probe problem for \((r,\ell )\)-well-coveredness ⋮ The cyclomatic number of a graph and its independence polynomial at \(- 1\) ⋮ 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 relating edges in graphs without cycles of length 4 ⋮ ModelingK-coteries by well-covered graphs ⋮ Weighted well-covered claw-free graphs ⋮ Triangulations and equality in the domination chain ⋮ Cohen-Macaulayness of saturation of the second power of edge ideals ⋮ On Gorenstein graphs ⋮ On the roots of independence polynomials of almost all very well-covered graphs ⋮ On vertex decomposable and Cohen-Macaulay regular graphs ⋮ On well-covered Cartesian products ⋮ On well-covered pentagonalizations of the plane ⋮ Well-covered graphs and factors ⋮ Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture ⋮ Complexity results for generating subgraphs ⋮ On the well-coveredness of Cartesian products of graphs ⋮ Shedding vertices of vertex decomposable well-covered graphs ⋮ Weighted well-covered graphs without cycles of lengths 5, 6 and 7 ⋮ 1-well-covered graphs revisited ⋮ On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6 ⋮ Unnamed Item ⋮ A characterization of well-covered graphs in terms of forbidden costable subgraphs ⋮ The Clique Corona Operation and Greedoids ⋮ The uniformity space of hypergraphs and its applications ⋮ Cohen–Macaulay graphs with large girth ⋮ Recognizing Generating Subgraphs Revisited ⋮ Well-covered graphs without cycles of lengths 4, 5 and 6 ⋮ Well-covered graphs and extendability ⋮ Partitions and well-coveredness: the graph sandwich problem ⋮ Unmixedness of some weighted oriented graphs ⋮ 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
