| Original language | Undefined/Unknown |
|---|---|
| Pages (from-to) | 647-657 |
| Number of pages | 11 |
| Journal | Graphs and Combinatorics |
| Volume | 23 |
| Issue number | 6 |
| Publication status | Published - 2007 |
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver
Tight lower bounds on the size of a matching in a regular graph
- M. Henning
- , Anders Yeo
Research output: Contribution to journal › Article › peer-review