Pages that link to "Item:Q2891042"
From MaRDI portal
The following pages link to Connectivity keeping trees in k-connected graphs (Q2891042):
Displaying 14 items.
- Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs (Q1625789) (← links)
- Critical vertices in \(k\)-connected digraphs (Q1688272) (← links)
- Connectivity keeping stars or double-stars in 2-connected graphs (Q1699561) (← links)
- Connectivity keeping paths in \(k\)-connected bipartite graphs (Q2075535) (← links)
- Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three (Q2092431) (← links)
- Connectivity keeping caterpillars and spiders in 2-connected graphs (Q2222940) (← links)
- Connectivity keeping trees in 2-connected graphs (Q2280001) (← links)
- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions (Q5041201) (← links)
- Connectivity preserving trees in <i>k</i>‐connected or <i>k</i>‐edge‐connected graphs (Q6046680) (← links)
- Connectivity keeping trees in 3-connected or 3-edge-connected graphs (Q6056744) (← links)
- Mader's conjecture for graphs with small connectivity (Q6057633) (← links)
- Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs (Q6204330) (← links)
- Highly connected triples and Mader's conjecture (Q6642502) (← links)
- Connectivity preserving Hamiltonian cycles in \(k\)-connected Dirac graphs (Q6661726) (← links)
