Max-cut and extendability of matchings in distance-regular graphs
- Award ID(s):
- 1600768
- PAR ID:
- 10093559
- Date Published:
- Journal Name:
- European Journal of Combinatorics
- Volume:
- 62
- Issue:
- C
- ISSN:
- 0195-6698
- Page Range / eLocation ID:
- 232 to 244
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
An official website of the United States government

