High connectivity keeping sets in graphs and digraphs

DOI10.1016/J.DISC.2004.07.032zbMATH Open1076.05049OpenAlexW1964558620MaRDI QIDQ2575793FDOQ2575793

W. Mader

Publication date: 6 December 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.032

Recommendations

• High connectivity keeping sets in \(n\)-connected graphs
• Highly edge-connected detachments of graphs and digraphs
• High connectivity keeping connected subgraph
• The connectivity of large digraphs and graphs
• A connected subgraph maintaining high connectivity
• scientific article; zbMATH DE number 2188339
• Connectivity in hypergraphs
• On the connectivity of certain graphs of high girth.
• Highly connected non-2-linked digraphs
• Connectivity keeping edges in graphs with large minimum degree

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Uncontractable 4-connected graphs
• Kuratowski's theorem
• Generalizaions of critical connectivity of graphs
• A recursive characterization of the 4-connected graphs
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On locally \(k\)-critically \(n\)-connected graphs
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Title not available (Why is that?)
• On the existence of \((k,l)\)-critical graphs
• On \(k\)-con-critically \(n\)-connected graphs
• The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
• Title not available (Why is that?)
• On \(k\)-critical \(2 k\)- connected graphs
• Zur Theorie der n-fach zusammenhängenden Graphen
• Contractible triples in 3-connected graphs
• Contractible subgraphs in 3-connected graphs
• On k-critical, n-connected graphs
• Fragments in 2-critically \(n\)-connected graphs
• Title not available (Why is that?)
• High connectivity keeping sets in \(n\)-connected graphs
• Title not available (Why is that?)
• Endlichkeitssätze für k-kritische Graphen
• Connectivity of circulant digraphs
• Eine Eigenschaft der Atome endlicher Graphen
• Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
• Title not available (Why is that?)
• Vertices of small degree in critically \(n\)-connected digraphs
• On critically connected digraphs
• Proof of Mader's conjecture on k‐critical n‐connected graphs
• Large k‐preserving sets in infinite graphs
• Title not available (Why is that?)
• On Vertices of outdegree n in minimally n‐connected digraphs
• Almost all 3-connected graphs contain a contractible set of \(k\) vertices

Cited In (5)

• Title not available (Why is that?)
• High connectivity keeping sets in \(n\)-connected graphs
• Contractibility and the Hadwiger conjecture
• Critical vertices in \(k\)-connected digraphs
• A connected subgraph maintaining high connectivity

This page was built for publication: High connectivity keeping sets in graphs and digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575793)