期刊名称：Canadian Journal on Computing in Mathematics, Natural Sciences, Engineering and Medicine
印刷版ISSN：1923-1660
出版年度：2011
卷号：2
期号：1
页码：1-10
出版社：AM Publishers Corporation Canada
摘要：A vertex covering set S containing at least one vertex from each color class is called a vertex cover coloring set of a graph G = (V, E) and the minimum cardinality taken over all vertex cover coloring sets of G is called a vertex cover chromatic number (G) of a graph G. In this paper, exact values of (G) for some standard graphs are obtained and the relations between (G) and some other graph theoretic parameters have been established.
