Pages that link to "Item:Q293170"
From MaRDI portal
The following pages link to A polynomial algorithm for the extendability problem in bipartite graphs (Q293170):
Displaying 6 items.
- 2-extendability of toroidal polyhexes and Klein-bottle polyhexes (Q1003671) (← links)
- The matching extension problem in general graphs is co-NP-complete (Q1743490) (← links)
- Matching theory and Barnette's conjecture (Q2099486) (← links)
- Extendability and criticality in matching theory (Q2175791) (← links)
- Construction for bicritical graphs and \(k\)-extendable bipartite graphs (Q2497479) (← links)
- Surface Embedding of Non-Bipartite $k$-Extendable Graphs (Q5865906) (← links)
