A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
复制标题
一些 2-连通图的表征以及对布鲁克斯定理的算法证明的评论
DOI：
10.1016/0012-365x(95)00082-8
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
V. Bryant
中科院分区：
文献类型：
--
作者：
V. Bryant
圈和完全图的一个简单刻画突出了它们在布鲁克斯定理中的重要性。然后，它表明，该定理的算法证明，通常在两种情况下处理，实际上是涵盖的情况之一。
A simple characterisation of cycles and complete graphs highlights their significance in Brooks' theorem. It then shows that an algorithmic proof of that theorem, usually dealt with in two cases, is in fact covered by one of the cases.