Pages that link to "Item:Q6046680"
From MaRDI portal
The following pages link to Connectivity preserving trees in <i>k</i>‐connected or <i>k</i>‐edge‐connected graphs (Q6046680):
Displaying 14 items.
- Non-separating trees in connected graphs (Q1045001) (← links)
- Pendant tree-connectivity (Q1059087) (← links)
- \(k\)-connectivity and decomposition of graphs into forests (Q1343147) (← 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 \(k\)-connected graphs (Q2891042) (← links)
- Connectivity keeping paths in k-connected graphs (Q3055926) (← links)
- On low bound of degree sequences of spanning trees inK-edge-connected graphs (Q4242971) (← links)
- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions (Q5041201) (← links)
- Connectivity keeping trees in 2‐connected graphs (Q5110674) (← links)
- (Q5355044) (← links)
- Connectivity keeping trees in 3-connected or 3-edge-connected graphs (Q6056744) (← links)
- Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs (Q6204330) (← links)
- Connectivity preserving Hamiltonian cycles in \(k\)-connected Dirac graphs (Q6661726) (← links)
