Pages that link to "Item:Q1318795"
From MaRDI portal
The following pages link to Well-covered graphs and extendability (Q1318795):
Displaying 17 items.
- Local maximum stable set greedoids stemming from very well-covered graphs (Q444454) (← links)
- Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) (Q628320) (← links)
- Mind the independence gap (Q776261) (← links)
- The well-covered dimension of random graphs (Q864120) (← 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)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- 1-extendability of independent sets (Q2169951) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- Well-covered graphs and factors (Q2492219) (← links)
- The structure of well-covered graphs with no cycles of length 4 (Q2643318) (← links)
- VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS (Q3087098) (← links)
- Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets (Q5862679) (← 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)
