Pages that link to "Item:Q2222947"
From MaRDI portal
The following pages link to Bounding and approximating minimum maximal matchings in regular graphs (Q2222947):
Displaying 9 items.
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (Q1262767) (← links)
- Minimum maximal matchings in cubic graphs (Q2144321) (← links)
- Tight lower bounds on the size of a maximum matching in a regular graph (Q2478167) (← links)
- Maximal matching and edge domination in complete multipartite graphs (Q2921894) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427) (← links)
- (Q3161275) (← links)
- (Q4474098) (← links)
- Nordhaus-Gaddum-type results on the connected edge domination number (Q6202040) (← links)