On the connectivity of \(p\)-diamond-free graphs
From MaRDI portal
Publication:1045100
DOI10.1016/j.disc.2009.05.009zbMath1191.05059MaRDI 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
05C40: Connectivity
Related Items
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