The following pages link to (Q3139770):
Displaying 10 items.
- On the complexity of a family of generalized matching problems (Q1068535) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Efficient subgraphs packing (Q1321999) (← links)
- Generalized subgraph-restricted matchings in graphs (Q1779490) (← links)
- Strongly polynomial simplex algorithm for bipartite vertex packing (Q1917242) (← links)
- An NC algorithm for the perfect matching problem in larger cycle-free graphs (Q2741350) (← links)
- Computational complexity of existence problems for matchings in graphs. (Q2756482) (← links)
- Vertex packing algorithms (Q3741078) (← links)
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)
- On the completeness of a generalized matching problem (Q5402563) (← links)