Simpler multicoloring of triangle-free hexagonal graphs (Q658035)
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 5996484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simpler multicoloring of triangle-free hexagonal graphs |
scientific article; zbMATH DE number 5996484 |
Statements
Simpler multicoloring of triangle-free hexagonal graphs (English)
0 references
11 January 2012
0 references
Weighted clique number of a graph
0 references
0 references
0.9140403270721436
0 references
0.893852949142456
0 references
0.8330732583999634
0 references
0.8330732583999634
0 references
0.8310059309005737
0 references
