Connectivity keeping trees in 2-connected graphs

DOI10.1016/j.disc.2019.111677zbMath1429.05110OpenAlexW2981088036WikidataQ126978154 ScholiaQ126978154MaRDI QIDQ2280001

Ping Zhang, Chang-hong Lu

Publication date: 17 December 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2019.111677

zbMATH Keywords

connectivity2-connected graphsisomorphic treescaterpillar trees

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Related Items (8)

Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions ⋮ Connectivity preserving trees in k‐connected or k‐edge‐connected graphs ⋮ Mader's conjecture for graphs with small connectivity ⋮ Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs ⋮ Connectivity keeping caterpillars and spiders in 2-connected graphs ⋮ Connectivity keeping trees in \(2\)-connected graphs with girth conditions ⋮ Connectivity keeping paths in \(k\)-connected bipartite graphs ⋮ Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three

Cites Work

• 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 trees in k-connected graphs
• Connectivity keeping paths in k-connected graphs
• Critically n-Connected Graphs

This page was built for publication: Connectivity keeping trees in 2-connected graphs