Pages that link to "Item:Q2462380"
From MaRDI portal
The following pages link to Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380):
Displaying 11 items.
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720) (← links)
- Local maximum stable set greedoids stemming from very well-covered graphs (Q444454) (← links)
- Crowns in bipartite graphs (Q510531) (← links)
- On local maximum stable set greedoids (Q658102) (← links)
- Graph operations that are good for greedoids (Q987691) (← links)
- Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
- Forbidden subgraphs and the König-Egerváry property (Q2444529) (← links)
- On maximum matchings in König-Egerváry graphs (Q2446347) (← links)
- VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS (Q3087098) (← links)
- On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph (Q3655146) (← links)
- The Clique Corona Operation and Greedoids (Q5505676) (← links)
