An improved upper bound for the acyclic chromatic number of 1-planar graphs (Q2192086)
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 7215481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved upper bound for the acyclic chromatic number of 1-planar graphs |
scientific article; zbMATH DE number 7215481 |
Statements
An improved upper bound for the acyclic chromatic number of 1-planar graphs (English)
0 references
29 June 2020
0 references
1-planar graph
0 references
acyclic coloring
0 references
plane graph
0 references
0.9215874671936036
0 references
0.8871442675590515
0 references
0.8681721687316895
0 references
0.8655752539634705
0 references
