Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number
From MaRDI portal
Publication:1717211
DOI10.7151/dmgt.2096zbMath1404.05104OpenAlexW2803874672WikidataQ129818509 ScholiaQ129818509MaRDI QIDQ1717211
Publication date: 7 February 2019
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2096
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Sufficient conditions for maximally edge-connected and super-edge-connected graphs
- A Graph-Theoretic Approach to a Communications Problem
- Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
This page was built for publication: Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number