共查询到3条相似文献，搜索用时 46 毫秒
1.
《数学物理学报(B辑英文版)》1999,19(4):375-381
A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removed the vertex subset from the graph. A polynomial algorithm for finding a minimum feedback vertex set of a 3-regular simple graph is provided. 相似文献
2.
《数学物理学报(B辑英文版)》1999,19(4):1
A subset of the vertex setof a graph is a feedback vertex set of thegraph if the resulting graph is a forest afterremoved the vertexsubset from the graph. A polynomial algorithm for finding aminimumfeedback vertex set of a 3-regular simple graph is provided. 相似文献
3.
许进 《数学物理学报(B辑英文版)》2004,24(4):577-582
A new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also the fastest among all the algorithms for the computation of chromatic polynomials. 相似文献