Fabien Jacques

most citedThe chromatic number of 2-edge-colored and signed graphs of bounded maximum degree

2 citations · 2 across the 1 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2021

The chromatic number of signed graphs with bounded maximum average degree

Fabien Jacques, Alexandre Pinlou

A signed graph is a simple graph with two types of edges: positive and negative edges. Switching a vertex $v$ of a signed graph corresponds to changing the type of each edge incide…

math.CO2020

On the chromatic numbers of signed triangular and hexagonal grids

Fabien Jacques

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 fro…

math.CO2020★ 2 cited

The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree

Christopher Duffy, Fabien Jacques, Mickael Montassier +1

A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph $G$ to a 2-edge-colored graph $H$ is a mapping $φ: V(…

math.CO2020

Homomorphisms of planar $(m, n)$ -colored-mixed graphs to planar targets

Fabien Jacques, Pascal Ochem

An $(m, n)$ -colored-mixed graph $G = (V, A_{1}, A_{2}, \dots, A_{m}, E_{1}, E_{2}, \dots, E_{n})$ is a graph having $m$ colors of arcs and $n$ colors of edges. We do not allow two arcs or edges…

The chromatic number of signed graphs with bounded maximum average degree

On the chromatic numbers of signed triangular and hexagonal grids

The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree

Homomorphisms of planar (m,n)-colored-mixed graphs to planar targets

Homomorphisms of planar $(m, n)$ -colored-mixed graphs to planar targets