Pages that link to "Item:Q1751242"
From MaRDI portal
The following pages link to Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242):
Displaying 13 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)
- Even cycles and perfect matching problems with side constraints (Q1888173) (← 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)
- Finding maximum square-free 2-matchings in bipartite graphs (Q2498740) (← links)
- Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs (Q4608650) (← 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)
- Finding triangle-free 2-factors in general graphs (Q6540256) (← links)
- On maximum Zagreb indices of bipartite graphs with a given connectivity (Q6650429) (← links)
