Lower-bounds on the connectivities of a graph
From MaRDI portal
Publication:3815344
DOI10.1002/jgt.3190090411zbMath0664.05050OpenAlexW1973102168MaRDI QIDQ3815344
Publication date: 1985
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190090411
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Connectivity (05C40)
Related Items
Sufficient conditions for maximally connected dense graphs, Lower bounds on the vertex-connectivity of digraphs and graphs, Note on the connectivity of line graphs, Large fault-tolerant interconnection networks, Lower connectivities of regular graphs with small diameter, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, On local connectivity of graphs, Super edge-connectivity of dense digraphs and graphs, On local connectivity of graphs with given clique number, The connectivity and minimum degree of circuit graphs of matroids, Edge-connectivity in hypergraphs, Superconnectivity of bipartite digraphs and graphs, On the connectivity of \(p\)-diamond-free graphs, The superconnectivity of large digraphs and graphs
