On local connectivity of graphs with given clique number

DOI10.1002/jgt.20419zbMath1187.05041OpenAlexW4240198704MaRDI QIDQ5190329

Lutz Volkmann, Andreas Holtkamp

Publication date: 15 March 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20419

zbMATH Keywords

local connectivityconnectivityclique numberminimum degree

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

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 local connectivity of 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 local connectivity of graphs with given clique number