Winding number and circular 4-coloring of signed graphs

Abstract

Concerning the recent notion of circular chromatic number of signed graphs, for each given integer $k$ we introduce two signed bipartite graphs, each on $2k^2-k+1$ vertices, having shortest negative cycle of length $2k$, and the circular chromatic number 4. Each of the construction can be viewed as a bipartite analogue of the generalized Mycielski graphs on odd cycles, $M_{\ell}(C_{2k+1})$. In the course of proving our result, we also obtain a simple proof of the fact that $M_{\ell}(C_{2k+1})$ and some similar quadrangulations of the projective plane have circular chromatic number 4. These proofs have the advantage that they illuminate, in an elementary manner, the strong relation between algebraic topology and graph coloring problems.

Figures (11)

• Figure 1: $C_{_{\ell\times (2k+1)}}$ with layers highlighted.
• Figure 2: Constructions on bottom and top layers.
• Figure 3: Construction of $\widehat{BQ}(\ell,2k+1)$.
• Figure 4: $\widehat{BQ}(2,3)$, presented two different ways.
• Figure 5: $\widehat{BQ}(3,5)$.

Theorems & Definitions (30)

• Proposition 1
• Proposition 2
• proof
• Proposition 3
• proof
• Proposition 4
• Lemma 5
• proof
• Lemma 7
• proof