Pages that link to "Item:Q1743490"
From MaRDI portal
The following pages link to The matching extension problem in general graphs is co-NP-complete (Q1743490):
Displaying 6 items.
- A polynomial algorithm for the extendability problem in bipartite graphs (Q293170) (← links)
- The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness (Q2115210) (← links)
- 1-extendability of independent sets (Q2169951) (← links)
- Extendability and criticality in matching theory (Q2175791) (← links)
- 1-extendability of independent sets (Q6119830) (← links)
- The extendability of Cayley graphs generated by transpositions (Q6180652) (← links)