Enviar artigo por via de e-mail On the Decomposition of a 3-Connected Graph into Cyclically 4-Edge-Connected Components
- Autores: Pastor A.V.1
-
Afiliações:
- St.Petersburg Department of Steklov Institute of Mathematics and Peter the Great St.Petersburg Polytechnic University
- Edição: Volume 232, Nº 1 (2018)
- Páginas: 61-83
- Seção: Article
- URL: https://ogarev-online.ru/1072-3374/article/view/241263
- DOI: https://doi.org/10.1007/s10958-018-3859-0
- ID: 241263
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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 if removing any three edges from it results in either a connected graph or a graph with exactly two connected components one of which is a single-vertex one. We show how to associate with any 3-connected graph a tree of components such that every component is a 3-connected and cyclically 4-edge-connected graph.
Sobre autores
A. Pastor
St.Petersburg Department of Steklov Institute of Mathematics and Peter the Great St.Petersburg Polytechnic University
Autor responsável pela correspondência
Email: pastor@pdmi.ras.ru
Rússia, St.Petersburg
Arquivos suplementares
