Degree sequence conditions for maximally edge-connected graphs depending on the clique number
From MaRDI portal
Publication:1969791
DOI10.1016/S0012-365X(99)00279-4zbMath0941.05019MaRDI QIDQ1969791
Peter Dankelmann, Lutz Volkmann
Publication date: 30 July 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (10)
Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\) ⋮ On the edge-connectivity of C_4-free graphs ⋮ Super edge-connectivity and zeroth-order Randić index ⋮ Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Local-edge-connectivity in digraphs and oriented graphs ⋮ On the connectivity of visibility graphs ⋮ Super-edge-connectivity and zeroth-order Randić index ⋮ Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
This page was built for publication: Degree sequence conditions for maximally edge-connected graphs depending on the clique number
