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 |
相似书籍
-
Strong parity vertex coloring of plane graphs
由: Tomas Kaiser, et al.
出版: (2014-03-01) -
A bound on the number of perfect matchings in Klee-graphs
由: Marek Cygan, et al.
出版: (2013-01-01) -
On the complexity of vertex-coloring edge-weightings
由: Andrzej Dudek, et al.
出版: (2011-11-01) -
Long cycles in hypercubes with distant faulty vertices
由: Petr Gregor, et al.
出版: (2009-01-01) -
Gray codes avoiding matchings
由: Darko Dimitrov, et al.
出版: (2009-01-01)