Finding cut-vertices in the square roots of a graph

DOI10.1007/978-3-319-68705-6_18zbMath1483.05136OpenAlexW2610279470MaRDI QIDQ5915795

Guillaume Ducoffe

Publication date: 4 January 2018

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-68705-6_18

Mathematics Subject Classification ID

Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Finding cut-vertices in the square roots of a graph ⋮ Finding cactus roots in polynomial time ⋮ Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2

This page was built for publication: Finding cut-vertices in the square roots of a graph