Pages that link to "Item:Q3569807"
From MaRDI portal
The following pages link to Restricted b-Matchings in Degree-Bounded Graphs (Q3569807):
Displaying 15 items.
- 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)
- Restricted matching in graphs of small genus (Q998321) (← 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)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
- Matching for Graphs of Bounded Degree (Q3507330) (← 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)
- Restricted Bipartite Graphs: Comparison and Hardness Results (Q5251649) (← links)
- Finding triangle-free 2-factors in general graphs (Q6540256) (← links)
- Matchings under distance constraints. II. (Q6596960) (← links)