Francesco Silvestri
- Reinhard Diestel. Graph Theory (Graduate Texts in Mathematics). Springer, 2005.Google Scholar
- Jose Duato and Sudhakar Yalamanchili and Lionel M. Ni. Interconnection Networks. M. Kaufmann Publishers, 2002.Google Scholar
- Frank Thomson Leighton. Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. M. Kaufmann Publishers, 1992.Google Scholar
Index Terms
- Review of graph theory and interconnection networks, by Lih-Hsing Hsu and Cheng-Kuan Lin
Recommendations
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture
Chen, Lih, and Wu conjectured that for r ≥ 3, the only connected graphs with maximum degree at most r that are not equitably r-colorable are K r,r (for odd r) and K r+1. If true, this would be a strengthening of the Hajnal-Szemerédi Theorem and Brooks’ ...
Comments