An upper bound of linear chromatic number of planar graphs (Q2916456)
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: An upper bound of linear chromatic number of planar graphs |
scientific article; zbMATH DE number 6090982
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound of linear chromatic number of planar graphs |
scientific article; zbMATH DE number 6090982 |
Statements
5 October 2012
0 references
planar graph
0 references
linear coloring
0 references
linear chromatic number
0 references
maximum degree
0 references
union of vertex-disjoint paths
0 references
0.9639518
0 references
0.9589337
0 references
0.9489256
0 references
0.9439109
0 references
0.9344164
0 references
0.9270287
0 references
0.9177621
0 references
0.91634864
0 references
0.91631246
0 references
An upper bound of linear chromatic number of planar graphs (English)
0 references
