图和补图的荫度猜想

A conjecture of arboricity of graph and complement graph

点荫度是图论的重要概念之一,图的可平面性问题、有一个多世纪之悬案的四色猜想问题等也可从研究图的点荫度而寻找答案。这里得到一个结果:“n阶图G,均有a(G)+a(Gc)≤1+[n/2]},这是一个仅解决一小部的猜想,作者彻底决解完。

Vertex arboricity is one of important nonations of graph theory, it has great using in place graphs and four colour conjecture which has a long history, the authors show the result of vertex arboricity, i. e. for all graph G of order n, then G a(G) + a(Gc)≤1 +[n/2].