Pages that link to "Item:Q3993632"
From MaRDI portal
The following pages link to Complexity results for well‐covered graphs (Q3993632):
Displaying 17 items.
- Tracking the P-NP boundary for well-covered graphs (Q4345571) (← links)
- (Q4622618) (← links)
- A characterisation of well-covered cubic graphs (Q4693382) (← 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)
- Recognizing Generating Subgraphs Revisited (Q5859675) (← links)
- Strong cliques in diamond-free graphs (Q5919069) (← links)
- Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)
- 1-extendability of independent sets (Q6119830) (← links)
- (Q6168434) (← links)
- Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)
- Well-covered graphs with constraints on \(\Delta\) and \(\delta\) (Q6185607) (← links)
- Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs (Q6201337) (← links)
- Recognizing \(\text{W}_2\) graphs (Q6580488) (← links)
- 1-well-covered graphs containing a clique of size \(n/3\) (Q6669819) (← links)
