Covering vertices by cycles
Covering vertices by cycles
复制标题
按循环覆盖顶点
作者：
M. Kouider
如果G是一个2-连通图，有n个顶点，最小度为d，那么G的顶点可以被少于n/d个圈覆盖。这解决了Enomoto，Kaneko和Tuza关于2-连通图的一个猜想.
“If G is a 2-connected graph with n vertices and minimum degree d, then the vertices of G can be covered by less than n/d cycles. This settles a conjecture of Enomoto, Kaneko and Tuza for 2-connected graphs.”