On the 4-color theorem for signed graphs
Abstract
There are several ways to generalize graph coloring to signed graphs. M\'acajov\'a, Raspaud and Skoviera introduced one of them and conjectured that in this setting, for signed planar graphs four colors are always enough, generalising thereby The Four Color Theorem. We disprove the conjecture.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.