Connectivity keeping trees in k-connected graphs

DOI10.1002/jgt.20585zbMath1242.05147MaRDI QIDQ2891042

W. Mader

Publication date: 13 June 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20585

zbMATH Keywords

connectivity; \(k\)-connected graphs

Mathematics Subject Classification ID

05C05: Trees

05C35: Extremal problems in graph theory

05C40: Connectivity

Related Items

Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions, Connectivity preserving trees in k‐connected or k‐edge‐connected graphs, Connectivity keeping trees in 3-connected or 3-edge-connected graphs, Mader's conjecture for graphs with small connectivity, Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs, Critical vertices in \(k\)-connected digraphs, Connectivity keeping stars or double-stars in 2-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 caterpillars and spiders in 2-connected graphs, Connectivity keeping trees in 2-connected graphs

Cites Work

• Connectivity keeping edges in graphs with large minimum degree
• Non-separating trees in connected graphs
• Vertices of small degree in critically \(n\)-connected digraphs
• Connectivity keeping paths in k-connected graphs
• On critically connected digraphs
• Critically n-Connected Graphs