Connectivity keeping trees in \(2\)-connected graphs with girth conditions

DOI10.1007/s00453-021-00833-8OpenAlexW4231426154MaRDI QIDQ1979450

Toru Hasunuma

Publication date: 2 September 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-021-00833-8

zbMATH Keywords

connectivitygirthtrees\(2\)-connected graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (3)

Connectivity preserving trees in k‐connected or k‐edge‐connected graphs ⋮ Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs ⋮ Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three

Cites Work

• Unnamed Item
• Connectivity keeping edges in graphs with large minimum degree
• Non-separating trees in connected graphs
• Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs
• Connectivity keeping stars or double-stars in 2-connected graphs
• Connectivity keeping caterpillars and spiders in 2-connected graphs
• Connectivity keeping trees in 2-connected graphs
• Connectivity keeping paths in k-connected graphs
• Connectivity keeping trees in 2‐connected graphs
• Critically n-Connected Graphs

This page was built for publication: Connectivity keeping trees in \(2\)-connected graphs with girth conditions