Degree sequence conditions for equal edge‐connectivity and minimum degree, depending on the clique number

DOI10.1002/jgt.10087zbMath1017.05066OpenAlexW4241241280MaRDI QIDQ4800402

Lutz Volkmann

Publication date: 3 April 2003

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

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

zbMATH Keywords

clique numberedge-connectivitydegree sequence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07)

Related Items (2)

Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ On the connectivity of visibility graphs

This page was built for publication: Degree sequence conditions for equal edge‐connectivity and minimum degree, depending on the clique number