Výsledky vyhledávání - "Jacques, Fabien"

Report

The chromatic number of signed graphs with bounded maximum average degree

Autor: Jacques, Fabien, Pinlou, Alexandre

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 incident to $v$. A homomorphism from a signed graph $G$ to another signed gr

Externí odkaz: http://arxiv.org/abs/2104.11121

Zobrazit plný text záznamu

Report

On the chromatic numbers of signed triangular and hexagonal grids

Autor: Jacques, Fabien

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 $\varphi

Externí odkaz: http://arxiv.org/abs/2012.09678

Zobrazit plný text záznamu

Report

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

Autor: Duffy, Christopher, Jacques, Fabien, Montassier, Mickael, Pinlou, Alexandre

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 $\varphi: V(G) \rightarrow V(H)$ that maps every edge in $G$ to an edge of t

Externí odkaz: http://arxiv.org/abs/2009.05439

Zobrazit plný text záznamu

Report

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

Autor: Jacques, Fabien, Ochem, Pascal

An $(m, n)$-colored-mixed graph $G=(V, A_1, A_2,\cdots, A_m, E_1, E_2,\cdots, E_n)$ is a graph having $m$ colors of arcs and $n$ colors of edges. We do not allow two arcs or edges to have the same endpoints. A homomorphism from an $(m,n)$-colored-mix

Externí odkaz: http://arxiv.org/abs/2008.13747

Zobrazit plný text záznamu