Tangles and Connectivity in Graphs
classification
💻 cs.DM
math.CO
keywords
tanglescomponentsconnectivitycorrespondencegraphsorderemphasisgeneral
read the original abstract
This paper is a short introduction to the theory of tangles, both in graphs and general connectivity systems. An emphasis is put on the correspondence between tangles of order k and k-connected components. In particular, we prove that there is a one-to-one correspondence between the triconnected components of a graph and its tangles of order 3.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.