Kiyoshi Ando. k-connected graphs with minimum degree greater than or equal to ⌊3k-12⌋. Discrete Mathematics, 344(7):112416, 2021. [doi]
@article{Ando21-0,
title = {k-connected graphs with minimum degree greater than or equal to ⌊3k-12⌋},
author = {Kiyoshi Ando},
year = {2021},
doi = {10.1016/j.disc.2021.112416},
url = {https://doi.org/10.1016/j.disc.2021.112416},
researchr = {https://researchr.org/publication/Ando21-0},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {344},
number = {7},
pages = {112416},
}