Folding the sum, cartesian product, composition and square of graphs
Every connected graph folds onto some complete graph which is not necessarily unique. It is known that if p is the chromatic number of a connected graph G then G folds onto Kp and to no other smaller complete graphs. On the other hand, the largest complete graph onto which a connected graph folds is...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
2006
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_masteral/3427 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/10265/viewcontent/CDTG004176_P__1_.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | De La Salle University |
| 語言: | English |