Edge covering coloring of cartesian product and compositions of graphs
An edge coloring of a graph G is called an edge covering coloring if each color appears at each vertex at least once. The maximum positive integer k such that G has an edge covering coloring with k colors is called the edge covering chromatic index of G and is denoted by 0 c(G). A result from Gupta...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
2016
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_masteral/5460 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|