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

DOI10.1002/JGT.3190170606MaRDI QIDQ4285591zbMATH OpenOpenAlexFDO

Authors 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

minimum degreeconnectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• Graph theory with applications
• The connectivity of strongly regular graphs

Cited in

(12)

• scientific article; zbMATH DE number 866662 (Why is no real title available?)
• On local connectivity of graphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• The connectivity and minimum degree of circuit graphs of matroids
• On the connectivity of \(p\)-diamond-free graphs
• Lower bounds on the vertex-connectivity of digraphs and graphs
• On local connectivity of graphs with given clique number
• On the connectivity of diamond-free graphs
• A generalization of a theorem of Diderrich in additive group theory to vertex-transitive graphs
• A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
• Maximally connected \(p\)-partite uniform hypergraphs
• Some results for the rupture degree

This page was built for publication: Sufficient conditions for equality of connectivity and minimum degree of a graph

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