Minimal disconnected cuts in planar graphs (Q4642401)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6871396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal disconnected cuts in planar graphs |
scientific article; zbMATH DE number 6871396 |
Statements
Minimal disconnected cuts in planar graphs (English)
0 references
23 May 2018
0 references
vertex cut
0 references
connectivity
0 references
planar graph
0 references
0.991690754890442
0 references
0.8329319357872009
0 references
0.8135541677474976
0 references
0.8090900778770447
0 references
0.8047714233398438
0 references
