Circular chromatic number of signed graphs

TLDR: In this paper, a signed graph is defined as a pair (G, σ) where G is a graph and σ : E(G) → {+, −} is a signature which assigns to each edge of G a sign.

Abstract: A signed graph is a pair (G, σ), where G is a graph and σ : E(G) → {+, −} is a signature which assigns to each edge of G a sign. Various notions of coloring of signed graphs have been studied. In this paper, we extend circular coloring of graphs to signed graphs. Given a signed graph (G, σ) a circular r-coloring of (G, σ) is an assignment ψ of points of a circle of circumference r to the vertices of G such that for every edge e = uv of G, if σ(e) = +, then ψ(u) and ψ(v) have distance at least 1, and if σ(e) = −, then ψ(v) and the antipodal of ψ(u) have distance at least 1. The circular chromatic number χ c (G, σ) of a signed graph (G, σ) is the infimum of those r for which (G, σ) admits a circular r-coloring. For a graph G, we define the signed circular chromatic number of G to be max{χ c (G, σ) : σ is a signature of G}. We study basic properties of circular coloring of signed graphs and develop tools for calculating χ c (G, σ). We explore the relation between the circular chromatic number and the signed circular chromatic number of graphs, and present bounds for the signed circular chromatic number of some families of graphs. In particular, we determine the supremum of the signed circular chromatic number of k-chromatic graphs of large girth, of simple bipartite planar graphs, d-degenerate graphs, simple outerplanar graphs and series-parallel graphs. We construct a signed planar simple graph whose circular chromatic number is 4 + 2 3. This is based and improves on a signed graph built by Kardos and Narboni as a counterexample to a conjecture of Macajova, Raspaud, and Skoviera.