Pages that link to "Item:Q328720"
From MaRDI portal
The following pages link to Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720):
Displaying 7 items.
- On graphs with a unique perfect matching (Q497377) (← links)
- Combinatorial and spectral properties of König-Egerváry graphs (Q516875) (← links)
- On some graphs with a unique perfect matching (Q1799576) (← links)
- On the König deficiency of zero-reducible graphs (Q2292142) (← links)
- On maximum matchings in König-Egerváry graphs (Q2446347) (← links)
- Unique maximum matching algorithms (Q2746432) (← links)
- Unique maximum matching algorithms (Q2819535) (← links)