On the IC-colorings of complete tripartite graphs

碩士 === 中原大學 === 應用數學研究所 === 99 === Let $G$ be a graph and let $f$ be a function which maps $V(G)$ into the set of positive integers. We define $f(H)=Sigma_{v in V(H)}f(v)$ for each subgraph $H$ of $G$. We say $f$ to be an extit{IC-coloring} of $G$ if for any integer $k in [1,f(G)]$ there is a conne...

Full description

Bibliographic Details
Main Authors: Chun-Yi Kuo, 郭俊億
Other Authors: Chin-Lin Shiue
Format: Others
Language:en_US
Published: 2011
Online Access:http://ndltd.ncl.edu.tw/handle/49537015849169965661