The Maximal IC-Colorings of K(3,n)
碩士 === 中原大學 === 應用數學研究所 === 99 === The purpose of this thesis is to give a complete solution for the maximal colorings of a complete bipartite graph K(3,n) with n≥3. The IC-index M(K(m,n)) has been obtained and hence some maximal colorings of K(m,n) were already discovered. The problem of finding a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/28636511241598636422 |