Connectivity keeping paths in k-connected graphs

DOI10.1002/jgt.20465zbMath1234.05145OpenAlexW4241396001MaRDI QIDQ3055926

W. Mader

Publication date: 10 November 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20465

zbMATH Keywords

pathsfragmentk-connected graphsemifragment

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Related Items (13)

Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions ⋮ Connectivity keeping trees in k-connected graphs ⋮ Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs ⋮ Connectivity preserving trees in k‐connected or k‐edge‐connected graphs ⋮ Connectivity keeping trees in 3-connected or 3-edge-connected graphs ⋮ Mader's conjecture for graphs with small connectivity ⋮ Connectivity keeping stars or double-stars in 2-connected graphs ⋮ Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs ⋮ Connectivity keeping caterpillars and spiders in 2-connected graphs ⋮ Connectivity keeping trees in \(2\)-connected graphs with girth conditions ⋮ Connectivity keeping trees in 2-connected graphs ⋮ Connectivity keeping paths in \(k\)-connected bipartite graphs ⋮ Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three

Cites Work

• High connectivity keeping sets in \(n\)-connected graphs
• Connectivity keeping edges in graphs with large minimum degree
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• On critically h-connected simple graphs
• Critically n-Connected Graphs
• Eine Eigenschaft der Atome endlicher Graphen

This page was built for publication: Connectivity keeping paths in k-connected graphs