Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (Q1686009)
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: Every signed planar graph without cycles of length from 4 to 8 is 3-colorable |
scientific article; zbMATH DE number 6820542
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every signed planar graph without cycles of length from 4 to 8 is 3-colorable |
scientific article; zbMATH DE number 6820542 |
Statements
Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (English)
0 references
20 December 2017
0 references
signed graph
0 references
planar graph
0 references
3-colorable graph
0 references
0 references
0.92407125
0 references
0.9208575
0 references
0.9119643
0 references
0.90243495
0 references
0.89837146
0 references
0.89462423
0 references
0.8940679
0 references
0.8919584
0 references
