Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
From MaRDI portal
Publication:6046680
Recommendations
Cites work
- A theorem on n-connected graphs
- Connectivity keeping paths in k-connected graphs
- Connectivity keeping trees in 2-connected graphs
- Connectivity keeping trees in 2-connected graphs
- Connectivity keeping trees in 2-connected graphs with girth conditions
- Connectivity keeping trees in k-connected graphs
- Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen
- Loebl-Komlós-Sós conjecture: dense case
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Minimally 2-connected graphs.
- Minimally n-line connected graphs.
- Non-separating trees in connected graphs
- On maximal paths and circuits of graphs
- On the Loebl-Koml�s-S�s conjecture
- On Vertices of Degree n in Minimally n-Edge-Connected Graphs
- Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
- The Erdös-Sós conjecture for graphs of girth 5
- The Komlós conjecture for graphs of girth 7
- The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
- Zur Struktur minimal n-fach zusammenhängender Graphen
- Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
Cited in
(15)- Non-separating trees in connected graphs
- Pendant tree-connectivity
- \(k\)-connectivity and decomposition of graphs into forests
- 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
- On low bound of degree sequences of spanning trees inK-edge-connected graphs
- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
- Connectivity keeping trees in 2-connected graphs
- scientific article; zbMATH DE number 6770102 (Why is no real title available?)
- Connectivity keeping trees in 3-connected or 3-edge-connected graphs
- Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs
- Connectivity preserving Hamiltonian cycles in \(k\)-connected Dirac graphs
- A survey on the vertex-(edge-)k-maximal graphs and the k-vertex-(edge-)connected graphs with redundant subgraphs
This page was built for publication: Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046680)
