A generalization of the block decomposition for k-connected graphs

• Ano de defesa: 2022
• Autor(a) principal: Malpartida, Jared León
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: eng
• Instituição de defesa: Biblioteca Digitais de Teses e Dissertações da USP
• Palavras-chave em Português: Árvore de blocos; Block decomposition; Block tree; Decomposição por blocos; K-conexidade; K-connectivity
• Link de acesso: https://www.teses.usp.br/teses/disponiveis/45/45134/tde-02032023-200641/

The decomposition of a connected graph by the set of its cut-vertices, sometimes called the \"block decomposition\" or \"block tree\" of a graph, is a well known and basic concept in graph theory. This decomposition, however, does not provide meaningful information when applied to a k-connected graph for k > 1. There has been a number of attempts to generalize the construction of the block decomposition of a graph for the case of k-connected graphs. Notably, Tutte constructed a tree that describes the mutual arrangement of 2-cutsets in a 2-connected graph. This decomposition has some similarities to the block decomposition of a connected graph. In other works, a block of a k-connected graph was defined as a maximal (k+1)-connected subgraph. Karpov described the decomposition of a k-connected graph by the set of k-cutsets that are not separated by any other k-cutset of the graph. Karpov also described some special properties of his decomposition for the case of a 2-connected graph. The decompositions defined by Karpov and Tutte for the case of a 2-connected graph share some similarities. In this work, we present a self-contained description of Karpov\'s decomposition. We also present some applications to the study of planarity, the chromatic number, critically 2-connected graphs, and the partition of certain 2-connected graphs into three connected subgraphs.