The following pages link to (Q4179024):
Displayed 47 items.
- On well-covered, vertex decomposable and Cohen-Macaulay graphs (Q289983) (← links)
- Well-covered triangulations. IV (Q323041) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← 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)
- Independent protection in graphs (Q400447) (← 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)
- On average lower independence and domination numbers in graphs (Q556830) (← links)
- Path spectra for trees (Q607002) (← links)
- Complexity results for generating subgraphs (Q724239) (← links)
- Mind the independence gap (Q776261) (← links)
- The uniformity space of hypergraphs and its applications (Q1301700) (← 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)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Very well covered graphs (Q1837211) (← links)
- Weighted well-covered graphs without cycles of lengths 5, 6 and 7 (Q2059877) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- Well-hued graphs (Q2166254) (← links)
- 1-extendability of independent sets (Q2169951) (← links)
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
- Graphs in which all maximal bipartite subgraphs have the same order (Q2216453) (← links)
- Domination, eternal domination, and clique covering (Q2344016) (← links)
- Well-covered graphs without cycles of lengths 4, 5 and 6 (Q2345607) (← links)
- Extremal graphs for a new upper bound on domination parameters in graphs (Q2433699) (← links)
- A note on graphs contraction-critical with respect to independence number (Q2449144) (← links)
- On the roots of independence polynomials of almost all very well-covered graphs (Q2473044) (← links)
- Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type (Q2481813) (← links)
- Well-covered graphs and factors (Q2492219) (← links)
- Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture (Q2493111) (← links)
- On \(\alpha\)-excellent graphs (Q2683166) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- A class of planar well‐covered graphs with girth four (Q4320467) (← links)
- (Q4622618) (← links)
- (Q5149984) (← links)
- The Clique Corona Operation and Greedoids (Q5505676) (← links)
- Recognizing Generating Subgraphs Revisited (Q5859675) (← links)
- Neighborhood unions and regularity in graphs (Q5941517) (← links)
- Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)
- 1-extendability of independent sets (Q6119830) (← links)
- Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)
- Well-covered graphs with constraints on \(\Delta\) and \(\delta\) (Q6185607) (← links)