Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference10 articles.
1. Critically n-connected graphs;Chartrand;Proc. Am. Math. Soc.,1972
2. A property of 4-chromatic graphs and some remarks on critical graphs;Dirac;J. Lond. Math. Soc.,1952
3. Non-separating trees in connected graphs;Diwan;Discrete Math.,2009
4. Connectivity preserving trees in k-connected or k-edge-connected graphs;Hasunuma;J. Graph Theory,2023
5. Connectivity keeping trees in 2-connected graphs;Hasunuma;J. Graph Theory,2019