Sufficient conditions for equality of connectivity and minimum degree of a graph

DOI10.1002/jgt.3190170606zbMath0794.05063OpenAlexW2036208097MaRDI QIDQ4285591

Jerzy Topp, Lutz Volkmann

Publication date: 24 March 1994

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

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

zbMATH Keywords

connectivityminimum degree

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items

Lower bounds on the vertex-connectivity of digraphs and graphs ⋮ On the connectivity of diamond-free graphs ⋮ Maximally connected \(p\)-partite uniform hypergraphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ On local connectivity of graphs ⋮ SOME RESULTS FOR THE RUPTURE DEGREE ⋮ On local connectivity of graphs with given clique number ⋮ The connectivity and minimum degree of circuit graphs of matroids ⋮ On the connectivity of \(p\)-diamond-free graphs

Cites Work

• The connectivity of strongly regular graphs
• Unnamed Item
• Unnamed Item