Palettes of Dehn colorings for spatial graphs and the classification of vertex conditions
In this paper, we study Dehn colorings of spatial graph diagrams, and classify the vertex conditions, equivalently the palettes. We give some example of spatial graphs which can be distinguished by the number of Dehn colorings with selecting an appropriate palette. Furthermore, we also discuss the generalized version of palettes, which is defined for knot-theoretic ternary-quasigroups and region colorings of spatial graph diagrams.
2014 ◽
Vol 23
(06)
◽
pp. 1450034
◽
2015 ◽
Vol 08
(02)
◽
pp. 1550029
◽
Keyword(s):
2016 ◽
Vol 25
(04)
◽
pp. 1650019
Keyword(s):
2017 ◽
Vol 26
(05)
◽
pp. 1750025
2003 ◽
Vol 134
(1)
◽
pp. 53-67
◽
2017 ◽
Vol 26
(14)
◽
pp. 1750100
◽
Keyword(s):
2017 ◽
Vol 26
(08)
◽
pp. 1750050
Keyword(s):
2010 ◽
Vol 19
(06)
◽
pp. 829-841
◽
2011 ◽
Vol 22
(11)
◽
pp. 1545-1559
Keyword(s):