By using Theorem 3.5, we give a polynomial time algorithm to determine the cyclic vertex connectivity of cubic graphs. The algorithm is similar to that of ...

In this paper, for any k-regular graph G with girth g and the number v of vertices, we give a sufficient condition v ≥ 2 g ( k − 1 ) for the cyclic vertex ...

A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs · Mathematics, Computer Science. Journal of combinatorial optimization · 2019.

This paper presents a recursive algorithm to find all the cyclic edge cutsets of an input cubic graph, with time complexity bounded by O(n3log2n). In this paper ...

We present an algorithm running in time O(n 2 log 2 n) for computing the cyclic edge connectivity of n-vertex cubic graphs.

In this paper, we develop a polynomial time algorithm to find out all the minilnum cyclic edge cutsets of a 3-regular graph, and therefore to determine the ...

In this paper, for a k-regular graph G with fixed k value, we give a polynomial time algorithm to determine c?(G) and its time complexity is bounded by O(v15/2 ...

A polynomial time algorithm to find out all the minilnum cyclic edge cutsets of a 3-regular graph, and therefore to determine the Cyclic edge connectivity ...

The polynomial algorithm for constructing a special Eulerian cycle in a plane connected 4-regular graph G = (V,E) is presented in the paper. First of all any ...

Nov 13, 2017 · The polynomial algorithms for determining the cyclic edge connectivity of cubic graphs and k- regular graphs had not been solved until a few.