Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three (Q2092431): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4225426284 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2205.00397 / rank | |||
Normal rank | |||
Revision as of 01:56, 19 April 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
