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]

Authors

Qing Yang

This author has not been identified. Look up 'Qing Yang' in Google

Yingzhi Tian

This author has not been identified. Look up 'Yingzhi Tian' in Google