Cyclic Chromatic Number of 3-Connected Plane Graphs
From MaRDI portal
Publication:2706194
DOI10.1137/S0895480198346150zbMath0960.05048MaRDI QIDQ2706194
Mirko Horňák, Hikoe Enomoto, Stanlislav Jendroľ
Publication date: 19 March 2001
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Related Items (18)
Third case of the cyclic coloring conjecture ⋮ Cyclic 4-Colorings of Graphs on Surfaces ⋮ Contractions, cycle double covers, and cyclic colorings in locally connected graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Cyclic coloring of plane graphs with maximum face size 16 and 17 ⋮ Facial rainbow edge-coloring of plane graphs ⋮ Parity vertex colouring of plane graphs ⋮ On the cyclic coloring conjecture ⋮ A survey on the cyclic coloring and its relaxations ⋮ Cyclic colorings of plane graphs with independent faces ⋮ Another step towards proving a conjecture by Plummer and Toft ⋮ 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 ⋮ Coloring the faces of convex polyhedra so that like colors are far apart
This page was built for publication: Cyclic Chromatic Number of 3-Connected Plane Graphs