Pages that link to "Item:Q448969"
From MaRDI portal
The following pages link to An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs (Q448969):
Displaying 4 items.
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems (Q444382) (← links)
- Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424) (← links)
