Cyclic Chromatic Number of 3-Connected Plane Graphs
From MaRDI portal
Publication:2706194
DOI10.1137/S0895480198346150zbMath0960.05048MaRDI QIDQ2706194
Hikoe Enomoto, Mirko Horňák, Stanlislav Jendroľ
Publication date: 19 March 2001
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
Related Items
Parity vertex colouring of plane graphs, Contractions, cycle double covers, and cyclic colorings in locally connected graphs, Another step towards proving a conjecture by Plummer and Toft, Facial colorings using Hall's theorem, Cyclic, diagonal and facial colorings, Coloring the faces of convex polyhedra so that like colors are far apart, Coloring plane graphs with independent crossings, A general upper bound for the cyclic chromatic number of 3‐connected plane graphs