On (Strong) Rainbow Connection Number of Graphs
碩士 === 國立嘉義大學 === 資訊工程學系研究所 === 103 === Most of the graph coloring problems deal with vertices. This thesis discusses a kind of edge coloring that adjacent edges may be colored the same. A path P in graph G is a rainbow path if none of the edges in P are colored the same. The minimum number of color...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/56680860694881692768 |