Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable. (Q3134302)
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 6836973
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable. |
scientific article; zbMATH DE number 6836973 |
Statements
9 February 2018
0 references
5-colorable graph
0 references
1-planar graph
0 references
cross vertices
0 references
cross faces
0 references
0.8967557549476624
0 references
0.8820574283599854
0 references
0.8794496655464172
0 references
0.869746208190918
0 references
