Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions

DOI10.1007/978-3-030-48966-3_24OpenAlexW3029510114MaRDI QIDQ5041201

Toru Hasunuma

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48966-3_24

zbMATH Keywords

connectivitygirthtrees2-connected graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Connectivity keeping paths in \(k\)-connected bipartite graphs

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 trees in k-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