On the connectivity of \(p\)-diamond-free graphs
type: Item
instance of: scholarly article
title: On the connectivity of \(p\)-diamond-free graphs
zbMATH Open document ID: 1191.05059
author: Andreas Holtkamp
author: Lutz Volkmann
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5648140
zbMATH Keywords: connectivity
zbMATH Keywords: local connectivity
zbMATH Keywords: minimum degree
zbMATH Keywords: diamond-free graph
zbMATH Keywords: \(p\)-diamond-free graph
MaRDI profile type: Publication
full work available at URL: j.disc.2009.05.009
OpenAlex ID: W2003511004
cites work: Connectivity of graphs with given girth pair
cites work: On the connectivity of diamond-free graphs
cites work: Lower-bounds on the connectivities of a graph
cites work: Maximally connected digraphs
cites work: Bipartite graphs and digraphs with maximum connectivity
cites work: The connectivity of large digraphs and graphs
cites work: On connectivity in graphs with given clique number
cites work: Maximally edge-connected and vertex-connected graphs and digraphs: A survey
cites work: Sufficient conditions for maximally connected dense graphs
cites work: Sufficient conditions for equality of connectivity and minimum degree of a graph
DOI: 10.1016/J.DISC.2009.05.009
description: scientific article; zbMATH DE number 5648140