Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three
From MaRDI portal
Publication:2092431
DOI10.1016/j.disc.2022.113207zbMath1502.05113arXiv2205.00397MaRDI QIDQ2092431
Publication date: 2 November 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.00397
Related Items
Connectivity keeping trees in 3-connected or 3-edge-connected graphs, Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs
Cites Work
- Unnamed Item
- Connectivity keeping edges in graphs with large minimum degree
- Non-separating trees in connected 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 trees in \(2\)-connected graphs with girth conditions
- Connectivity keeping paths in \(k\)-connected bipartite 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
- Critically n-Connected Graphs
- Mader's conjecture for graphs with small connectivity