# On the chromatic numbers of signed triangular and hexagonal grids

A signed graph is a simple graph with two types of edges. Switching a vertex v of a signed graph corresponds to changing the type of each edge incident to v. A homomorphism from a signed graph G to another signed graph H is a mapping φ: V(G) → V(H) such that, after switching any number of the vertices of G, φ maps every edge of G to an edge of the same type in H. The chromatic number χ_s(G) of a signed graph G is the order of a smallest signed graph H such that there is a homomorphism from G to H. We show that the chromatic number of signed triangular grids is at most 10 and the chromatic number of signed hexagonal grids is at most 4.

## Authors

• 3 publications
• ### The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree

A 2-edge-colored graph or a signed graph is a simple graph with two type...
09/11/2020 ∙ by Christopher Duffy, et al. ∙ 0

• ### Signified chromatic number of grids is at most 9

A signified graph is a pair (G, Σ) where G is a graph, and Σ is a set of...
09/01/2019 ∙ by Janusz Dybizbański, et al. ∙ 0

• ### Property Graph Type System and Data Definition Language

Property graph manages data by vertices and edges. Each vertex and edge ...
10/20/2018 ∙ by Mingxi Wu, et al. ∙ 0

• ### The chromatic number of signed graphs with bounded maximum average degree

A signed graph is a simple graph with two types of edges: positive and n...
04/22/2021 ∙ by Fabien Jacques, et al. ∙ 0

• ### Embedding of Hypercube into Cylinder

Task mapping in modern high performance parallel computers can be modele...
11/25/2015 ∙ by Weixing Ji, et al. ∙ 0

• ### Robotic Mapping with Polygonal Random Fields

Two types of probabilistic maps are popular in the mobile robotics liter...
07/04/2012 ∙ by Mark Paskin, et al. ∙ 0