Connectivity keeping trees in 2-connected graphs
From MaRDI portal
Publication:2280001
Recommendations
- Connectivity keeping trees in 2-connected graphs
- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
- Connectivity keeping trees in 2-connected graphs with girth conditions
- Connectivity keeping trees in k-connected graphs
- Connectivity keeping trees in 3-connected or 3-edge-connected graphs
- Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
- scientific article; zbMATH DE number 4051653
- On connectivities of tree graphs
- Connectivity keeping paths in k-connected graphs
- Connectivity keeping stars or double-stars in 2-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 k-connected graphs
- Critically n-Connected Graphs
- Non-separating trees in connected graphs
- Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs
Cited in
(23)- 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 k-connected graphs
- Cohesion and non-separating trees in connected graphs
- Connectivity keeping paths in k-connected graphs
- scientific article; zbMATH DE number 1933241 (Why is no real title available?)
- Minimal \(k\)-connected graphs with small number of vertices of degree \(k\)
- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
- Connectivity keeping trees in 2-connected graphs
- 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
- Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs
- Highly connected triples and Mader's conjecture
- Non-path results on the connectivity keeping problem
- A survey on the vertex-(edge-)k-maximal graphs and the k-vertex-(edge-)connected graphs with redundant subgraphs
- Proof of a conjecture on connectivity keeping odd paths in k-connected bipartite graphs
- Connectivity keeping paths for k-connected bipartite graphs
- Exploring redundant trees in bipartite graphs
This page was built for publication: Connectivity keeping trees in 2-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280001)
