k-connected graphs with minimum degree greater than or equal to ⌊3k-12⌋

Kiyoshi Ando. k-connected graphs with minimum degree greater than or equal to ⌊3k-12⌋. Discrete Mathematics, 344(7):112416, 2021. [doi]

Abstract

Abstract is missing.