The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
2
For an arbitrary polyhedral graph, four classes of polyhedral links can be obtained by applying the operation of 'x-tangle covering 'to the related reduced sets.