The IC-coloring and the IC-index of K(1,1,n)
碩士 === 中原大學 === 應用數學研究所 === 97 === We extend the idea of stamp problem to IC-coloring and study it. Let G be a connected graph and let . For each connected subgraph H of G; we define . If for each integer , there is a connected subgraph H of G such that , then f is called an IC-coloring of G. The...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/68293348723392918205 |