Abstract
Coloring a signed graph by signed colors, one has a chromatic polynomial with the same enumerative and algebraic properties as for ordinary graphs. New phenomena are the interpretability only of odd arguments and the existence of a second chromatic polynomial counting zero-free colorings. The generalization to voltage graphs is outlined.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have