Pages that link to "Item:Q6057633"

The following pages link to Mader's conjecture for graphs with small connectivity (Q6057633):

Displaying 11 items.

• On the number of edges in a graph with no \((k + 1)\)-connected subgraphs (Q898127) (← links)
• Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs (Q1625789) (← links)
• Connectivity keeping stars or double-stars in 2-connected graphs (Q1699561) (← links)
• Connectivity keeping trees in \(2\)-connected graphs with girth conditions (Q1979450) (← links)
• Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three (Q2092431) (← links)
• Proof of Mader's conjecture on <i>k</i>‐critical <i>n</i>‐connected graphs (Q4459607) (← links)
• Connectivity keeping trees in 2‐connected graphs (Q5110674) (← 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)
• Highly connected triples and Mader's conjecture (Q6642502) (← links)
• Connectivity preserving Hamiltonian cycles in \(k\)-connected Dirac graphs (Q6661726) (← links)