Distinguishing colorings of 3-connected planar graphs with five colors (Q2799604)
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 6568395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distinguishing colorings of 3-connected planar graphs with five colors |
scientific article; zbMATH DE number 6568395 |
Statements
13 April 2016
0 references
distinguishing colorings
0 references
planar graphs
0 references
topological graph theory
0 references
0 references
0.90401816
0 references
0.90379643
0 references
0.9003037
0 references
0.89952195
0 references
0 references
0.8948201
0 references
0.89455587
0 references
0.89269435
0 references
Distinguishing colorings of 3-connected planar graphs with five colors (English)
0 references
A proper coloring of \(G\) with \(k\) colors is called a distinguishing \(k\)-coloring of \(G\) if there is no color-preserving automorphism of \(G\) other than the identity map. It is proved that every \(3\)-connected planar graph, with the exceptions of \(K_{2,2,2}\) and \(C_6+\overline K_2\), admits a distinguishing \(5\)-coloring which uses color \(5\) for one vertex.NEWLINENEWLINEBy contrast, it is given examples of \(3\)-connected planar graphs that have distinguishing \(4\)-colorings but no distinguishing \(4\)-coloring with one color used only once.
0 references
