Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three (Q2092431): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 22:29, 1 February 2024
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