On a theorem of Chartrand, Kapoor and Kronk

DOI10.1007/BF02849495zbMath0226.05120OpenAlexW1984615292MaRDI QIDQ2548966

Tudor I. Zamfirescu

Publication date: 1970

Published in: Rendiconti del Circolo Matemàtico di Palermo. Serie II (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02849495

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (1)

Maximally edge-connected and vertex-connected graphs and digraphs: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• A sufficient condition for n ‐connectedness of graphs

This page was built for publication: On a theorem of Chartrand, Kapoor and Kronk