Fingerprint
Dive into the research topics of 'Eigenvalue bounds for the distance-t chromatic number of a graph and their application to perfect Lee codes'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Eigenvalue bounds for the distance-t chromatic number of a graph and their application to perfect Lee codes
Aida Abiad Monge, Alessandro Neri, Luuk E.R.M. Reijnders
Research output: Contribution to journal › Article › Academic › peer-review