Pages that link to "Item:Q4608650"
From MaRDI portal
The following pages link to Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs (Q4608650):
Displaying 7 items.
- An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs (Q448969) (← links)
- A note on \({\mathtt V}\)-free 2-matchings (Q727204) (← links)
- Maximum cardinality 1-restricted simple 2-matchings (Q1010633) (← links)
- Alternating cycle-free matchings (Q1325959) (← links)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
- Even cycles and perfect matching problems with side constraints (Q1888173) (← links)
- Finding maximum square-free 2-matchings in bipartite graphs (Q2498740) (← links)