0
喜欢
0
书签
声明论文
Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function   
摘  要:   Abstract: Let f(n) ? minf (G H ) : G and H are n-chromatic digraphsg and g(n) ? minf (G H ) : G and H are n-chromatic graphs}. We prove that f is bounded if and only if g is bounded. 2005 Wiley Periodicals, Inc. J Graph Theory 51: 33-36, 2006 Keywords: categorical product; Hedetniemi's conjecture; chromatic number; Poljak-Ro¨dl function
发  表:   Journal of Graph Theory  2006

论文统计图
共享有6个版本
 [展开全部版本] 

Bibtex
创新指数 
阅读指数 
重现指数 
论文点评
还没有人点评哦

Feedback
Feedback
Feedback
我想反馈:
排行榜