Recommendations
Cites work
- scientific article; zbMATH DE number 3900784 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 3310750 (Why is no real title available?)
- Every planar map is four colorable. I: Discharging
- On cyclic colorings and their generalizations
- The four-colour theorem
Cited in
(24)- A unified approach to distance-two colouring of graphs on surfaces
- Coloring the faces of convex polyhedra so that like colors are far apart
- A survey on the cyclic coloring and its relaxations
- Parity vertex colouring of plane graphs
- Cyclic coloring of plane graphs with maximum face size 16 and 17
- New Bounds for the Dichromatic Number of a Digraph
- New approximation guarantee for chromatic number
- Facial rainbow edge-coloring of plane graphs
- Cyclic 4-colorings of graphs on surfaces
- Facially-constrained colorings of plane graphs: a survey
- Third case of the cyclic coloring conjecture
- Facial rainbow coloring of plane graphs
- On the cyclic coloring conjecture
- Third case of the cyclic coloring conjecture
- Facial colorings using Hall's theorem
- Another step towards proving a conjecture by Plummer and Toft
- scientific article; zbMATH DE number 6988815 (Why is no real title available?)
- Cyclic, diagonal and facial colorings
- Cyclic colorings of plane graphs with independent faces
- A general upper bound for the cyclic chromatic number of 3-connected plane graphs
- A bound on the chromatic number of the square of a planar graph
- Facial nonrepetitive vertex coloring of plane graphs
- Coverage with \(k\)-transmitters in the presence of obstacles
- Coloring plane graphs with independent crossings
This page was built for publication: A new bound on the cyclic chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850557)
