On vertex types and cyclic colourings of 3-connected plane graphs

DOI10.1016/S0012-365X(99)00212-5zbMath0957.05040OpenAlexW1992769444MaRDI QIDQ1970582

Mirko Horňák, Stanlislav Jendroľ

Publication date: 7 June 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00212-5

zbMATH Keywords

cyclic chromatic number3-connected plane graphcyclic colouring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Third case of the cyclic coloring conjecture ⋮ Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable ⋮ Cyclic coloring of plane graphs with maximum face size 16 and 17 ⋮ A survey on the cyclic coloring and its relaxations ⋮ 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 ⋮ A structural theorem on embedded graphs and its application to colorings

This page was built for publication: On vertex types and cyclic colourings of 3-connected plane graphs