Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three

Qing Yang, Yingzhi Tian. Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three. Discrete Mathematics, 346(1):113207, 2023. [doi]

Abstract

Abstract is missing.