Skip to Main content Skip to Navigation
Conference papers

Finding cut-vertices in the square roots of a graph

Guillaume Ducoffe 1, 2
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : The square of a given graph $H = (V, E)$ is obtained from $H$ by adding an edge between every two vertices at distance two in $H$. Given a graph class $\mathcal{H}$, the $\mathcal{H}$-\textsc{Square Root} problem asks for the recognition of the squares of graphs in $\mathcal{H}$. In this paper, we answer positively to an open question of [Golovach et al., IWOCA'16] by showing that the squares of cactus-block graphs can be recognized in polynomial time. Our proof is based on new relationships between the decomposition of a graph by cut-vertices and the decomposition of its square by clique cutsets. More precisely, we prove that the closed neighbourhoods of cut-vertices in $H$ induce maximal subgraphs of $G = H^2$ with no clique-cutset. Furthermore, based on this relationship, we can compute from a given graph $G$ the block-cut tree of a desired square root (if any). Although the latter tree is not uniquely defined, we show surprisingly that it can only differ marginally between two different roots. Our approach not only gives the first polynomial-time algorithm for the $\mathcal{H}$-\textsc{Square Root} problem for several graph classes $\mathcal{H}$, but it also provides a unifying framework for the recognition of the squares of trees, block graphs and cactus graphs — among others.
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01627959
Contributor : Guillaume Ducoffe <>
Submitted on : Thursday, November 2, 2017 - 4:19:37 PM
Last modification on : Tuesday, May 26, 2020 - 6:50:53 PM
Document(s) archivé(s) le : Saturday, February 3, 2018 - 1:49:08 PM

File

Ducoffe-WG17.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Guillaume Ducoffe. Finding cut-vertices in the square roots of a graph. 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Jun 2017, Eindhoven, Netherlands. pp.234--248, ⟨10.1007/978-3-319-68705-6_18⟩. ⟨hal-01627959⟩

Share

Metrics

Record views

273

Files downloads

359