Every 1-planar graph without cycles of length 3 or 4 is 5-colorable (Q3131939)
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 6831416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every 1-planar graph without cycles of length 3 or 4 is 5-colorable |
scientific article; zbMATH DE number 6831416 |
Statements
29 January 2018
0 references
1-planar graph
0 references
cross vertices
0 references
\(k\)-colorable
0 references
cross faces
0 references
不含3圈和4圈的1-平面图是5-可染的 (English)
0 references
0.91738623380661
0 references
0.8794496655464172
0 references
0.811006486415863
0 references
0.807790994644165
0 references
