Realizable problems of Boolean matrices and the relations between realizable Boolean matrices and chromatic number of graphs (Q3071841)
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: Realizable problems of Boolean matrices and the relations between realizable Boolean matrices and chromatic number of graphs |
scientific article; zbMATH DE number 5846841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Realizable problems of Boolean matrices and the relations between realizable Boolean matrices and chromatic number of graphs |
scientific article; zbMATH DE number 5846841 |
Statements
5 February 2011
0 references
realizable Boolean matrix
0 references
content
0 references
simple graph
0 references
chromatic number
0 references
nilpotent-Jacobian method
0 references
0.7896918654441833
0 references
0.7492863535881042
0 references
