A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-019-00400-6
Abstract: For a connected graph G, a set S of vertices is a cyclic vertex cutset if $$G - S$$G-S is not connected and at least two components of $$G-S$$G-S contain a cycle respectively. The cyclic… read more here.
Keywords: algorithm determining; polynomial algorithm; vertex connectivity; cyclic vertex ... See more keywords