Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets (Q3970896): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:21, 29 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets |
scientific article |
Statements
Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets (English)
0 references
25 June 1992
0 references
3-connected graph
0 references
covering of contractible edges
0 references
