Third case of the Cyclic Coloring Conjecture

@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}
}
View PDF on arXiv
4 Citations
Highly Influential Citations
1
Background Citations
1

4 Citations

Citation Type

Citation Type

Cyclic coloring of plane graphs with maximum face size 16 and 17
A Survey on the Cyclic Coloring and its Relaxations
TLDR
A survey on the state of the art concerning the cyclic coloring and relaxations of this graph invariant.
Facial Rainbow Coloring of Plane Graphs
TLDR
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.
Square coloring planar graphs with automatic discharging
TLDR
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.

References

SHOWING 1-10 OF 39 REFERENCES
On cyclic colorings and their generalizations
Cyclic coloring of plane graphs
Facial colorings using Hall's Theorem
On a conjecture by Plummer and Toft
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…
On vertex types and cyclic colourings of 3-connected plane graphs
A New Bound on the Cyclic Chromatic Number
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.…
A new proof of the 6 color theorem
TLDR
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.
3-Facial Coloring of Plane Graphs
TLDR
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.
Cyclic, diagonal and facial colorings
Another step towards proving a conjecture by Plummer and Toft
...
1
2
3
4
...