Pages that link to "Item:Q444454"
From MaRDI portal
The following pages link to Local maximum stable set greedoids stemming from very well-covered graphs (Q444454):
Displaying 7 items.
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720) (← links)
- On local maximum stable set greedoids (Q658102) (← links)
- Graph operations that are good for greedoids (Q987691) (← links)
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings (Q1414591) (← links)
- Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- (Q3587708) (← links)