On the Decomposition of a 3-Connected Graph into Cyclically 4-Edge-Connected Components
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Mathematical Sciences"
DOI: 10.1007/s10958-018-3859-0
Abstract: A graph is called cyclically 4-edge-connected if removing any three edges from it results in a graph in which at most one connected component contains a cycle. A 3-connected graph is 4-edge-connected if and only… read more here.
Keywords: graph cyclically; connected components; decomposition connected; connected graph ... See more keywords