Connectivity keeping edges in graphs with large minimum degree

DOI10.1016/j.jctb.2007.11.001zbMath1155.05037OpenAlexW2072217169MaRDI QIDQ933682

Shinya Fujita, Ken-ichi Kawarabayashi

Publication date: 24 July 2008

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.11.001

zbMATH Keywords

ConnectivityEdge deletionMinimum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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 ⋮ 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 ⋮ Extremal infinite graph theory ⋮ Connectivity keeping paths in k-connected graphs ⋮ 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

• Unnamed Item
• Unnamed Item
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Generalizaions of critical connectivity of graphs
• On critically h-connected simple graphs
• On multiply critically h-connected graphs
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]
• On k-critical, n-connected graphs
• Distribution of contractible edges in k-connected graphs
• Contractible triples in 3-connected graphs
• Contractible cycles in graphs with large minimum degree
• On \(k\)-con-critically \(n\)-connected graphs
• Critically n-Connected Graphs
• Eine Eigenschaft der Atome endlicher Graphen

This page was built for publication: Connectivity keeping edges in graphs with large minimum degree