THE CHROMATICITY OF THE COMPLEMENT OF THE CYCLES UNION  

作　　者：郭知熠 李永洁 

机构地区：[1]Department of Mathematics, Huazhong University of Science and Technology, Wuhan 430074, PRC [2]Department of Management, Wuhan Urban Construction Institute, Wuhan 430080, PRC

出　　处：《Chinese Science Bulletin》1990年第7期608-608,共1页

摘　　要：The graphs considered here are finite and contain no loops nor multiple edges. Let G be such a graph, M(G; W) be its matching polynomial defined by Farrell in 1979, P(G; λ) be its chromatic polynomial. A graph G is matching unique if for any graph H,

关 键 词：matching polynomial CHROMATIC WHITEHEAD LETTER COMPLEMENT plies 罗理 cycle 

分 类 号：N[自然科学总论]