The t-Tone Coloring of Kneser Graphs KG(n,2)
碩士 === 輔仁大學 === 數學系碩士班 === 103 === A t-tone k-coloring of a graph G is a function f:V(G)→{[k] choose t} such that |f(u) ∩ f(v)| < d(u,v) for all distinct vertices u and v. The t-tone chromatic number of G, denoted τ_{t}(G), is the smallest positive integer k such that G has a t-tone k-coloring....
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/52881537415226571252 |