Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three (Q2092431)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three |
scientific article |
Statements
Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three (English)
0 references
2 November 2022
0 references
connectivity
0 references
bipartite graphs
0 references
caterpillars
0 references
spiders
0 references
