Pages that link to "Item:Q3503219"

The following pages link to On Maximum Cost $K_{t,t}$‐Free <i>t</i>‐Matchings of Bipartite Graphs (Q3503219):

Displaying 13 items.

• An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
• A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs (Q429657) (← links)
• A proof of Cunningham's conjecture on restricted subgraphs and jump systems (Q444382) (← links)
• An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs (Q448969) (← links)
• Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
• A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges (Q2032181) (← links)
• Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles (Q2118149) (← links)
• Matchings under distance constraints. I (Q2241576) (← 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)
• A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs (Q3503840) (← links)
• Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles (Q5041752) (← links)
• Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424) (← links)