On the connectivity of diamond-free graphs

DOI10.1016/j.dam.2007.05.010zbMath1126.05064OpenAlexW2005353525MaRDI QIDQ2384395

Angelika Hellwig, Lutz Volkmann, Peter Dankelmann

Publication date: 21 September 2007

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

Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.010

zbMATH Keywords

diamonddiamond-free graph\(C_4\)-free graph

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (4)

On the edge-connectivity of C_4-free graphs ⋮ On the connectivity of \(p\)-diamond-free vertex transitive graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ On the connectivity of \(p\)-diamond-free graphs

Cites Work

• Radius, diameter, and minimum degree
• Sufficient conditions for equality of connectivity and minimum degree of a graph
• The strong chromatic index ofC4-free graphs
• Minors in graphs of large girth
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the connectivity of diamond-free graphs