科研之友
微信
新浪微博
Facebook
分享链接
摘要
It is conjectured that. chi'(as)(G) = chi(t)(G) for every k-regular graph G with no C(5) component (k >= 2). This conjecture is shown to be true for many classes of graphs, including: graphs of type 1; 2-regular, 3-regular and (vertical bar V(G)vertical bar - 2)-regular graphs; bipartite graphs; balanced complete multipartite graphs; k-cubes; and joins of two matchings or cycles.
