A sufficient condition for n ‐connectedness of graphs
From MaRDI portal
Publication:5563927
DOI10.1112/S0025579300002369zbMath0175.20703OpenAlexW2144187080MaRDI QIDQ5563927
H. V. Kronk, Gary Chartrand, S. F. Kapoor
Publication date: 1968
Published in: Mathematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s0025579300002369
Related Items (8)
On the \(\ell\)-connectivity of a graph ⋮ Degree sequence conditions for a graph to be disjoint path coverable ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Sufficient degree conditions fork-edge-connectedness of a graph ⋮ Graph theory ⋮ On a theorem of Chartrand, Kapoor and Kronk ⋮ The strongest monotone degree condition for \(n\)-connectedness of a graph
This page was built for publication: A sufficient condition for n ‐connectedness of graphs
