Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs

DOI10.1016/j.disc.2024.113913arXiv2303.03896OpenAlexW4391669478MaRDI QIDQ6204330

Yingzhi Tian, Qing Yang

Publication date: 27 March 2024

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

Full work available at URL: https://arxiv.org/abs/2303.03896

zbMATH Keywords

connectivitytrees3-connected graph3-edge-connected graph

Mathematics Subject Classification ID

Graph theory (05Cxx) Algebraic combinatorics (05Exx) Combinatorics (05-XX)

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 with girth conditions
• Connectivity keeping paths in \(k\)-connected bipartite graphs
• Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three
• 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
• A theorem on n-connected graphs
• Critically n-Connected Graphs
• Minimally n-line connected graphs.
• Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
• Mader's conjecture for graphs with small connectivity

This page was built for publication: Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs