Connectivity keeping paths in \(k\)-connected bipartite graphs

DOI10.1016/j.disc.2021.112788zbMath1482.05173arXiv2011.03929OpenAlexW3103506079MaRDI QIDQ2075535

Yingzhi Tian, Lian Luo, Liyun Wu

Publication date: 14 February 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.03929

zbMATH Keywords

pathsconnectivitybipartite graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (3)

Connectivity keeping trees in 3-connected or 3-edge-connected graphs ⋮ Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs ⋮ Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three

Cites Work

• Unnamed Item
• Connectivity keeping edges in graphs with large minimum degree
• Non-separating trees in connected graphs
• On critically h-connected simple graphs
• Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs
• Connectivity keeping stars or double-stars in 2-connected graphs
• Connectivity keeping caterpillars and spiders in 2-connected graphs
• Connectivity keeping trees in 2-connected graphs
• Connectivity keeping trees in k-connected graphs
• Connectivity keeping paths in k-connected graphs
• Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
• Connectivity keeping trees in 2‐connected graphs
• Critically n-Connected Graphs

This page was built for publication: Connectivity keeping paths in \(k\)-connected bipartite graphs