Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905)
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 6282958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable |
scientific article; zbMATH DE number 6282958 |
Statements
Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (English)
0 references
11 April 2014
0 references
combinatorial problems
0 references
planar graph
0 references
cycle
0 references
improper coloring
0 references
0 references
0 references
0.96309817
0 references
0.94259536
0 references
0.9418359
0 references
0.9397257
0 references
0.9378974
0 references
0.9358287
0 references
0.9354341
0 references
0.92973924
0 references
0.9285127
0 references
