Non-three-colourable common graphs exist (Q2911071)
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: Non-three-colourable common graphs exist |
scientific article; zbMATH DE number 6081449
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-three-colourable common graphs exist |
scientific article; zbMATH DE number 6081449 |
Statements
12 September 2012
0 references
common graphs
0 references
number of copies
0 references
5-wheel
0 references
Non-three-colourable common graphs exist (English)
0 references
0.8422894477844238
0 references
0.8422894477844238
0 references
0.8402302265167236
0 references
0.8346904516220093
0 references
0.8035101294517517
0 references
