O. Togni

activity

20102026

most citedOn Packing Colorings of Distance Graphs

38 citations · 61 across the 21 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

cs.DM2014

Completely Independent Spanning Trees in Some Regular Graphs

Benoit Darties, Nicolas Gastineau, Olivier Togni

Let $k \geq 2$ be an integer and $T_{1}, \dots, T_{k}$ be spanning trees of a graph $G$ . If for any pair of vertices $(u, v)$ of $V (G)$ , the paths from $u$ to $v$ in each $T_{i}$ , $1\le i\l…

math.CO2014

Free choosability of the cycle

Yves Aubry, Jean-Christophe Godin, Olivier Togni

A graph $G$ is free $(a, b)$ -choosable if for any vertex $v$ with $b$ colors assigned and for any list of colors of size $a$ associated with each vertex $u \neq = v$ , the coloring can b…

cs.DM2014

S-Packing Colorings of Cubic Graphs

Nicolas Gastineau, Olivier Togni

Given a non-decreasing sequence $S = (s_1, s_2, \dots, s_k)$ of positive integers, an {\em $S$ -packing coloring} of a graph $G$ is a mapping $c$ from $V (G)$ to $\{s\_1,s\_2, \ldot…