Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions

DOI10.1007/978-3-030-48966-3_24MaRDI QIDQ5041201zbMATH OpenOpenAlexFDO

Authors 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

2-connected graphsconnectivitygirthtrees

Mathematics Subject Classification ID

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

Recommendations

• Connectivity keeping trees in 2-connected graphs with girth conditions
• Connectivity keeping trees in 2-connected graphs
• Connectivity keeping trees in 2-connected graphs
• Connectivity keeping trees in k-connected graphs
• Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
• Connectivity keeping trees in 3-connected or 3-edge-connected graphs
• On connectivities of tree graphs
• On tree-connectivity and path-connectivity of graphs
• Connectivity keeping paths in k-connected graphs
• scientific article; zbMATH DE number 4051653

Cites work

• Connectivity keeping caterpillars and spiders in 2-connected graphs
• Connectivity keeping edges in graphs with large minimum degree
• Connectivity keeping paths in k-connected graphs
• Connectivity keeping stars or double-stars in 2-connected graphs
• Connectivity keeping trees in 2-connected graphs
• Connectivity keeping trees in 2-connected graphs
• Connectivity keeping trees in k-connected graphs
• Critically n-Connected Graphs
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• Non-separating trees in connected graphs
• Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs

Cited in

(6)

• Connectivity keeping trees in 2-connected graphs with girth conditions
• Connectivity keeping paths in \(k\)-connected bipartite graphs
• Connectivity keeping caterpillars and spiders in 2-connected graphs
• Connectivity keeping trees in 2-connected graphs
• Connectivity keeping trees in k-connected graphs
• Highly connected triples and Mader's conjecture

This page was built for publication: Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041201)