On the connectivity of \(p\)-diamond-free graphs

DOI10.1016/j.disc.2009.05.009zbMath1191.05059OpenAlexW2003511004MaRDI QIDQ1045100

Andreas Holtkamp, Lutz Volkmann

Publication date: 15 December 2009

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

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

zbMATH Keywords

local connectivityconnectivityminimum degreediamond-free graph\(p\)-diamond-free graph

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (1)

On the connectivity of \(p\)-diamond-free vertex transitive graphs

Cites Work

• Connectivity of graphs with given girth pair
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Sufficient conditions for maximally connected dense graphs
• Bipartite graphs and digraphs with maximum connectivity
• On the connectivity of diamond-free graphs
• Lower-bounds on the connectivities of a graph
• Maximally connected digraphs
• Sufficient conditions for equality of connectivity and minimum degree of a graph
• The connectivity of large digraphs and graphs
• On connectivity in graphs with given clique number

This page was built for publication: On the connectivity of \(p\)-diamond-free graphs