On \(r\)-hued coloring of graphs with maximum average degree less than 3. (Q3382232)
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 7397967
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(r\)-hued coloring of graphs with maximum average degree less than 3. |
scientific article; zbMATH DE number 7397967 |
Statements
20 September 2021
0 references
\((k,r)\)-coloring
0 references
\(r\)-hued coloring
0 references
maximum average degree
0 references
0.9509179592132568
0 references
0.924106776714325
0 references
0.8899134993553162
0 references
0.880160391330719
0 references
0.8759921789169312
0 references
