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

DOI10.1016/j.disc.2023.113679MaRDI QIDQ6056744

Yanmei Hong, Qinghai Liu, Haiyang Liu

Publication date: 4 October 2023

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

zbMATH Keywords

subdivisionconnectivitytrees

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Cites Work

• Non-separating trees in connected graphs
• Connectivity keeping paths in \(k\)-connected bipartite graphs
• Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three
• Connectivity keeping trees in k-connected graphs
• Connectivity keeping paths in k-connected graphs
• Critically n-Connected Graphs
• A Property of 4-Chromatic Graphs and some Remarks on Critical 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 trees in 3-connected or 3-edge-connected graphs