Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
From MaRDI portal
Publication:6046680
DOI10.1002/JGT.22878zbMATH Open1522.05249MaRDI QIDQ6046680FDOQ6046680
Authors: Toru Hasunuma 
Publication date: 6 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Recommendations
Cites Work
- 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
- On maximal paths and circuits of graphs
- On the Loebl-Koml�s-S�s conjecture
- Loebl-Komlós-Sós conjecture: dense case
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Zur Struktur minimal n-fach zusammenhängender Graphen
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Minimally 2-connected graphs.
- A theorem on n-connected graphs
- Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
- On Vertices of Degree n in Minimally n-Edge-Connected Graphs
- The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
- Non-separating trees in connected graphs
- Minimally n-line connected graphs.
- Connectivity keeping trees in \(k\)-connected graphs
- Connectivity keeping paths in \(k\)-connected graphs
- Connectivity keeping trees in 2-connected graphs with girth conditions
- Connectivity keeping trees in 2-connected graphs
- Connectivity keeping trees in 2-connected graphs
Cited In (13)
- Connectivity keeping trees in 2-connected graphs
- Connectivity keeping trees in 2-connected graphs
- Connectivity keeping paths in \(k\)-connected graphs
- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
- Connectivity keeping caterpillars and spiders in 2-connected graphs
- \(k\)-connectivity and decomposition of graphs into forests
- Connectivity keeping trees in \(k\)-connected graphs
- Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs
- Non-separating trees in connected graphs
- Pendant tree-connectivity
- Connectivity preserving Hamiltonian cycles in \(k\)-connected Dirac graphs
- Connectivity keeping trees in 3-connected or 3-edge-connected graphs
- Title not available (Why is that?)
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)
