Strong parity vertex coloring of plane graphs

A strong parity vertex coloring of a 2-connected plane graph is a coloring of the vertices such that every face is incident with zero or an odd number of vertices of each color. We prove that every 2-connected loopless plane graph has a strong parity vertex coloring with 97 colors. Moreover the colo...

全面介绍

书目详细资料
Main Authors: Tomas Kaiser, Ondrej Rucky, Matej Stehlik, Riste Skrekovski
格式: 文件
语言:English
出版: Discrete Mathematics & Theoretical Computer Science 2014-01-01
丛编:Discrete Mathematics & Theoretical Computer Science
主题:
在线阅读:https://dmtcs.episciences.org/640/pdf

相似书籍