Pages that link to "Item:Q952636"
From MaRDI portal
The following pages link to On complexity of special maximum matchings constructing (Q952636):
Displaying 7 items.
- On upper bounds for parameters related to the construction of special maximum matchings (Q658043) (← links)
- Characterization of a class of graphs related to pairs of disjoint matchings (Q1011703) (← links)
- Blockers and transversals (Q1043948) (← links)
- Complexity of a disjoint matching problem on bipartite graphs (Q2629777) (← links)
- (Q5002612) (← links)
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)
- Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation (Q5219668) (← links)
