A sufficient condition for n ‐connectedness of graphs

• 1 June 1968
• journal article
• Published by Wiley in Mathematika
• Vol. 15  (1) , 51-52
• https://doi.org/10.1112/s0025579300002369

Abstract

Keywords

• FINITE
• GRAPH
• SUFFICIENT CONDITION
• CONNECTEDNESS
• TRIVIAL
• NOTE
• UNDIRECTED
• DISCONNECTS
• FEWER