The number of cutvertices in graphs with given minimum degree
From MaRDI portal
Publication:912123
DOI10.1016/0012-365X(90)90145-8zbMath0698.05038WikidataQ127646311 ScholiaQ127646311MaRDI QIDQ912123
Roger Entringer, Lane H. Clark
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
The number of cutvertices in graphs with given minimum degree ⋮ The number of cut-vertices in a graph of 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
