The normal graph conjecture is true for minimal unbreakable graphs (Q3090705)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The normal graph conjecture is true for minimal unbreakable graphs |
scientific article; zbMATH DE number 5944674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The normal graph conjecture is true for minimal unbreakable graphs |
scientific article; zbMATH DE number 5944674 |
Statements
31 August 2011
0 references
unbreakable graph
0 references
normal graph
0 references
weakly decomposition
0 references
recognition algorithm
0 references
0.7879598140716553
0 references
0.7739482522010803
0 references
0.771613597869873
0 references
0.7691872119903564
0 references
0.7592751383781433
0 references
