On cyclic colorings and their generalizations
From MaRDI portal
Publication:1301650
DOI10.1016/S0012-365X(99)00018-7zbMath0929.05027OpenAlexW1972664585MaRDI QIDQ1301650
Yue Zhao, Daniel P. Sanders, Oleg V. Borodin
Publication date: 11 January 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00018-7
Related Items (19)
Third case of the cyclic coloring conjecture ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Cyclic coloring of plane graphs with maximum face size 16 and 17 ⋮ Coverage with \(k\)-transmitters in the presence of obstacles ⋮ A unified approach to distance-two colouring of graphs on surfaces ⋮ On the cyclic coloring conjecture ⋮ A survey on the cyclic coloring and its relaxations ⋮ List 2-facial 5-colorability of plane graphs with girth at least 12 ⋮ Cyclic colorings of plane graphs with independent faces ⋮ Unnamed Item ⋮ Facial colorings using Hall's theorem ⋮ Cyclic, diagonal and facial colorings ⋮ Coloring plane graphs with independent crossings ⋮ Third Case of the Cyclic Coloring Conjecture ⋮ Facial rainbow coloring of plane graphs ⋮ A general upper bound for the cyclic chromatic number of 3‐connected plane graphs ⋮ Acyclic \(k\)-strong coloring of maps on surfaces ⋮ A new bound on the cyclic chromatic number ⋮ Coloring the faces of convex polyhedra so that like colors are far apart
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene
- Diagonal coloring of the vertices of triangulations
- Cyclic coloring of plane graphs
- On the \(d\)-distance face chromatic number of plane graphs
- The four-colour theorem
- On \(d\)-diagonal colorings of embedded graphs of low maximum face size
- Diagonal 11-coloring of plane triangulations
- Cyclic coloration of 3-polytopes
- Every Planar Map is Four Colorable
- Cyclic degree and cyclic coloring of 3-polytopes
- A new proof of the 6 color theorem
- On Diagonally 10‐Coloring Plane Triangulations
- On some properties of 4‐regular plane graphs
- Ond-diagonal colorings
This page was built for publication: On cyclic colorings and their generalizations