Pages that link to "Item:Q3507330"
From MaRDI portal
The following pages link to Matching for Graphs of Bounded Degree (Q3507330):
Displaying 8 items.
- Tight bound for matching (Q431927) (← links)
- Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
- Restricted matching in graphs of small genus (Q998321) (← links)
- An inductive characterization of matching in binding bigraphs (Q1941899) (← links)
- Quasi-best match graphs (Q2691571) (← links)
- (Q3391327) (← links)
- Tight lower bounds on the matching number in a graph with given maximum degree (Q4553732) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)