Cyclic degree and cyclic coloring of 3-polytopes

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199611)23:3<225::AID-JGT2>3.0.CO;2-U" /><225::AID-JGT2>3.0.CO;2-U 10.1002/(SICI)1097-0118(199611)23:3<225::AID-JGT2>3.0.CO;2-UzbMath0865.05042OpenAlexW4247272702MaRDI QIDQ4715276

Oleg V. Borodin

Publication date: 29 June 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199611)23:3<225::aid-jgt2>3.0.co;2-u

zbMATH Keywords

plane graph3-polytopecyclic chromatic numbercyclic colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

A survey on the cyclic coloring and its relaxations ⋮ Weight of faces in plane maps ⋮ A general upper bound for the cyclic chromatic number of 3‐connected plane graphs ⋮ On cyclic colorings and their generalizations ⋮ Coloring the faces of convex polyhedra so that like colors are far apart

This page was built for publication: Cyclic degree and cyclic coloring of 3-polytopes