Very well covered graphs
From MaRDI portal
Publication:1837211
DOI10.1016/0012-365X(82)90215-1zbMath0507.05053MaRDI QIDQ1837211
Publication date: 1982
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (50)
Strongly well-covered graphs ⋮ Building graphs whose independence polynomials have only real roots ⋮ Depth and regularity modulo a principal ideal ⋮ Very well-covered graphs and local cohomology of their residue rings by the edge ideals ⋮ Critical sets, crowns and local maximum independent sets ⋮ Recursively decomposable well-covered graphs ⋮ Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs ⋮ WELL-COVERED GRAPHS: A SURVEY ⋮ Well-hued graphs ⋮ When is \(G^2\) a König-Egerváry graph? ⋮ Maximum modulus of independence roots of graphs and trees ⋮ Jet graphs ⋮ A characterization of Zm-well-covered graphs of girth 6 or more ⋮ 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 ⋮ A classification of 1-well-covered graphs ⋮ On the Castelnuovo-Mumford regularity of squarefree powers of edge ideals ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ A set and collection lemma ⋮ Matchings, coverings, and Castelnuovo-Mumford regularity ⋮ Gorenstein homogeneous subrings of graphs ⋮ On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs ⋮ Very well-covered graphs by Betti splittings ⋮ The roller-coaster conjecture revisited ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ 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 ⋮ ModelingK-coteries by well-covered graphs ⋮ Equistable simplicial, very well-covered, and line graphs ⋮ On local maximum stable set greedoids ⋮ Weighted well-covered claw-free graphs ⋮ Crowns in bipartite graphs ⋮ On the roots of independence polynomials of almost all very well-covered graphs ⋮ Very well-covered graphs and their \(h\)-vectors ⋮ Well-covered graphs and factors ⋮ Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture ⋮ On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph ⋮ Shedding vertices of vertex decomposable well-covered graphs ⋮ A Note on Cohen–Macaulay Graphs ⋮ An Introduction to Game Domination in Graphs ⋮ VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS ⋮ 1-well-covered graphs revisited ⋮ The Clique Corona Operation and Greedoids ⋮ Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs ⋮ 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 ⋮ On well-covered direct products
Cites Work
This page was built for publication: Very well covered graphs
