Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen

DOI10.1016/S0195-6698(85)80048-2zbMath0591.05047MaRDI QIDQ1074599

W. Mader

Publication date: 1985

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

critically n-connected graphdisjoint fragments

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (26)

An upper bound for orders of certain \((k,\bar k)\)-connected graphs ⋮ Critically \((k,k)\)-connected graphs ⋮ Über \((k+1)\)-kritisch \((2k+1)\)-fach zusammenhängende Graphen. (On \((k+1)\)-critically \((2k+1)\)-connected graphs) ⋮ Generalizaions of critical connectivity of graphs ⋮ The symmetric (2k, k)-graphs ⋮ Contractible edges in \(k\)-connected infinite graphs ⋮ Fragments in kcritical n‐connected graphs ⋮ Non-separating subgraphs in highly connected graphs ⋮ Vertices of degree 6 in a contraction critically 6-connected graph ⋮ Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)] ⋮ Connectivity keeping edges in graphs with large minimum degree ⋮ Contractible edges in \(k\)-connected graphs with some forbidden subgraphs ⋮ Contractible edges in some k-connected graphs ⋮ Vertices of small degree in critically \(n\)-connected digraphs ⋮ Contractible edges in minimally \(k\)-connected graphs ⋮ On locally \(k\)-critically \(n\)-connected graphs ⋮ Trivially noncontractible edges in a contraction critically 5-connected graph ⋮ Connectivity keeping paths in k-connected graphs ⋮ Proof of Mader's conjecture on k‐critical n‐connected graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\) ⋮ Edge disjoint Steiner trees in graphs without large bridges ⋮ High connectivity keeping sets in graphs and digraphs ⋮ A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph ⋮ Contractible edges and triangles in \(k\)-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Non-\(\kappa\)-critical vertices in graphs
• On critically h-connected simple graphs
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
• A Note on k-Critically n-Connected Graphs
• On induced subgraphs of a block
• Critically n-Connected Graphs
• Eine Eigenschaft der Atome endlicher Graphen

This page was built for publication: Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen