Pages that link to "Item:Q3087098"
From MaRDI portal
The following pages link to VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS (Q3087098):
Displaying 4 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)
- Almost unimodal and real-rooted graph polynomials (Q2107505) (← links)
- Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866) (← links)
