Sufficient degree conditions fork-edge-connectedness of a graph
From MaRDI portal
Publication:3057109
DOI10.1002/net.20299zbMath1207.05109OpenAlexW4247939161MaRDI QIDQ3057109
S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel, Douglas Bauer
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20299
Related Items
On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences, Degree sequences and edge connectivity, Best monotone degree conditions for binding number, Best monotone degree conditions for graph properties: a survey, Best monotone degree conditions for binding number and cycle structure, Designs with blocks of size two and applications to microarray experiments, Spectral conditions for some graphical properties, A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected
Cites Work