Connectivity keeping caterpillars and spiders in 2-connected graphs

DOI10.1016/J.DISC.2020.112236MaRDI QIDQ2222940zbMATH OpenOpenAlexFDO

Authors Yanmei Hong, Qinghai Liu, Qingjie Ye, Changhong 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

treesspiderconnectivity2-connected graphscaterpillars

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Connectivity keeping trees in 2-connected graphs with girth conditions
• Connectivity keeping trees in 2-connected graphs
• Non-separating trees in connected graphs
• Connectivity keeping trees in 2-connected graphs
• Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)
• Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
• Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
• Connectivity keeping edges in graphs with large minimum degree
• Connectivity keeping stars or double-stars in 2-connected graphs
• Connectivity keeping trees in 3-connected or 3-edge-connected graphs

Cites work

• 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 \(k\)-connected graphs
• Critically n-Connected Graphs
• Graph theory
• Non-separating trees in connected graphs
• Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs

Cited in

(13)

• Connectivity keeping trees in 2-connected graphs
• Graphs with only caterpillars as spanning trees
• 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 paths in \(k\)-connected graphs
• Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
• Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs
• Highly connected triples and Mader's conjecture
• Mader's conjecture for graphs with small connectivity
• Connectivity keeping paths in \(k\)-connected bipartite graphs
• Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
• Connectivity keeping trees in 2-connected graphs with girth conditions
• Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three

This page was built for publication: Connectivity keeping caterpillars and spiders in 2-connected graphs

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