Pages that link to "Item:Q2752151"
From MaRDI portal
The following pages link to Unicycle bipartite graphs with only uniquely restricted maximum matchings (Q2752151):
Displaying 9 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)
- On local maximum stable set greedoids (Q658102) (← links)
- Graph operations that are good for greedoids (Q987691) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- On unicyclic graphs with uniquely restricted maximum matchings (Q2637732) (← links)
- Unicycle graphs and uniquely restricted maximum matchings (Q3439344) (← links)
- Graphs in which some and every maximum matching is uniquely restricted (Q4553727) (← links)
- The Clique Corona Operation and Greedoids (Q5505676) (← links)