Pages that link to "Item:Q998414"
From MaRDI portal
The following pages link to Bipartite matching extendable graphs (Q998414):
Displaying 10 items.
- Resilience and optimization of identifiable bipartite graphs (Q1941385) (← links)
- Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3 (Q2297715) (← links)
- (Q3014547) (← links)
- Bipartite matching-extendability of Halin graphs (Q3072964) (← links)
- (Q3073571) (← links)
- (Q3108942) (← links)
- BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS (Q3560059) (← links)
- (Q3800093) (← links)
- An extendable stable matching algorithm of a kind of bipartite graph (Q5069846) (← links)
- (Q5277315) (← links)