The number of cut-vertices in a graph of given minimum degree
From MaRDI portal
Publication:1176737
DOI10.1016/0012-365X(91)90402-NzbMath0756.05062MaRDI QIDQ1176737
David M. Berman, Michael O. Albertson
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (4)
The number of blocks of a graph with given minimum degree ⋮ The numbers of cut-vertices and end-blocks in 4-regular graphs ⋮ On the number of noncritical vertices in strongly connected digraphs ⋮ On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\)
Cites Work
This page was built for publication: The number of cut-vertices in a graph of given minimum degree
