The following pages link to Very well covered graphs (Q1837211):
Displaying 50 items.
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720) (← links)
- When is \(G^2\) a König-Egerváry graph? (Q367094) (← links)
- Extending Berge's and Favaron's results about well-covered graphs (Q394212) (← links)
- A set and collection lemma (Q405128) (← links)
- Matchings, coverings, and Castelnuovo-Mumford regularity (Q405389) (← links)
- Local maximum stable set greedoids stemming from very well-covered graphs (Q444454) (← links)
- Weighted well-covered claw-free graphs (Q482209) (← links)
- Crowns in bipartite graphs (Q510531) (← links)
- Very well-covered graphs and their \(h\)-vectors (Q520020) (← links)
- On local maximum stable set greedoids (Q658102) (← links)
- Building graphs whose independence polynomials have only real roots (Q844224) (← links)
- Well-covered graphs and extendability (Q1318795) (← links)
- A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets (Q1322267) (← links)
- Strongly well-covered graphs (Q1336664) (← links)
- Recursively decomposable well-covered graphs (Q1356429) (← links)
- The roller-coaster conjecture revisited (Q1696536) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Shedding vertices of vertex decomposable well-covered graphs (Q1800408) (← links)
- The cyclomatic number of a graph and its independence polynomial at \(- 1\) (Q1950412) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- On well-covered direct products (Q2118250) (← links)
- Very well-covered graphs and local cohomology of their residue rings by the edge ideals (Q2144369) (← links)
- Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
- Well-hued graphs (Q2166254) (← links)
- Maximum modulus of independence roots of graphs and trees (Q2175814) (← links)
- 1-well-covered graphs revisited (Q2311371) (← links)
- Well-covered graphs without cycles of lengths 4, 5 and 6 (Q2345607) (← links)
- Equistable simplicial, very well-covered, and line graphs (Q2448905) (← links)
- On the roots of independence polynomials of almost all very well-covered graphs (Q2473044) (← links)
- Well-covered graphs and factors (Q2492219) (← links)
- Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture (Q2493111) (← links)
- Depth and regularity modulo a principal ideal (Q2633457) (← links)
- Jet graphs (Q2668134) (← links)
- A glimpse to most of the old and new results on very well-covered graphs from the viewpoint of commutative algebra (Q2671741) (← links)
- Modeling \(k\)-coteries by well-covered graphs (Q2766106) (← links)
- A Note on Cohen–Macaulay Graphs (Q2810617) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS (Q3087098) (← links)
- An Introduction to Game Domination in Graphs (Q3384114) (← links)
- WELL-COVERED GRAPHS: A SURVEY (Q4288045) (← links)
- A characterization of Zm-well-covered graphs of girth 6 or more (Q4948753) (← links)
- A classification of 1-well-covered graphs (Q5097748) (← links)
- The Clique Corona Operation and Greedoids (Q5505676) (← links)
- Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs (Q5860653) (← links)
- On the Castelnuovo-Mumford regularity of squarefree powers of edge ideals (Q6057734) (← links)
- Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)
- Gorenstein homogeneous subrings of graphs (Q6090974) (← links)
- Very well-covered graphs by Betti splittings (Q6155806) (← links)
- Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)
