On partitionable, confidentially connected and unbreakable graphs (Q3009243)
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 5912069
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On partitionable, confidentially connected and unbreakable graphs |
scientific article; zbMATH DE number 5912069 |
Statements
23 June 2011
0 references
unbreakable graphs
0 references
confidentially connected
0 references
star cut set
0 references
weakly decomposition
0 references
recognition algorithm
0 references
0.8245636224746704
0 references
0.7691872119903564
0 references
0.757181704044342
0 references
0.739335298538208
0 references
