Distance constraints on short cycles for 3-colorability of planar graphs (Q497344)
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: Distance constraints on short cycles for 3-colorability of planar graphs |
scientific article; zbMATH DE number 6484823
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distance constraints on short cycles for 3-colorability of planar graphs |
scientific article; zbMATH DE number 6484823 |
Statements
Distance constraints on short cycles for 3-colorability of planar graphs (English)
0 references
24 September 2015
0 references
planar graphs
0 references
coloring
0 references
cycles
0 references
distance
0 references
adjacency
0 references
0 references
0 references
0 references
0.8891567587852478
0 references
0.8769758939743042
0 references
0.8672529458999634
0 references
0.8672060370445251
0 references
0.8658181428909302
0 references
