The Sigma Chromatic Number of the Circulant Graphs Cn(1,2) , Cn(1,3) , and C2n(1,n)
For a non-trivial connected graph G, let c:V(G)→N" role="presentation" style="box-sizing: border-box; display: inline-table; line-height: normal; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | text |
| 出版: |
Archīum Ateneo
2016
|
| 主題: | |
| 在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/76 https://link.springer.com/chapter/10.1007/978-3-319-48532-4_19 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Ateneo De Manila University |