Connectivity keeping trees in k-connected graphs
From MaRDI portal
Publication:2891042
DOI10.1002/jgt.20585zbMath1242.05147MaRDI QIDQ2891042
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
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