Connectivity keeping caterpillars and spiders in 2-connected graphs

DOI10.1016/j.disc.2020.112236zbMath1466.05111MaRDI QIDQ2222940

Qinghai Liu, Yanmei Hong, Qingjie Ye, Chang-hong Lu

Publication date: 27 January 2021

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

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

zbMATH Keywords

spider; connectivity; trees; 2-connected graphs; caterpillars

Mathematics Subject Classification ID

05C40: Connectivity

Related Items

Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions, Mader's conjecture for graphs with small connectivity, Connectivity keeping edges of trees in 3-connected or 3-edge-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

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