@article{Hebdige2015ThirdCO,
title={Third case of the Cyclic Coloring Conjecture},
author={Michael Hebdige and Daniel Kr{\'a}l},
journal={Electron. Notes Discret. Math.},
year={2015},
volume={49},
pages={11-15}
}

The facial rainbow number of a plane graph G, denoted by rb(G), is the minimum number of colors that are necessary in any facial rainbow coloring of G.Expand

This paper uses a Linear Programming approach to automatically look for a discharging proof, and makes some progress towards Wegner’s conjecture for distance- 2 coloring of planar graphs, by showing that 12 colors arecient to color at distance 2 every planar graph with maximum degree 4.Expand

The cyclic chromatic number χc(G) of a 2-connected plane graph G is the minimum number of colors in an assigment of colors to the vertices of G such that, for every face-bounding cycle f of G, the… Expand

In 1969, Ore and Plummer defined an angular coloring as a natural extension of the Four Color Problem: a face coloring of a plane graph where faces meeting even at a vertex must have distinct colors.… Expand

A shorter new proof is given here using only half as many of reducible configurations of the 6 color problem for graphs that can be stated in at least three different forms.Expand

It is proved that every plane graph is $3$-facially $11$-colorable and derived that every $2$-connected plane graph with maximum face-size at most $7$ is cyclically cyclically colorable.Expand