Výsledky vyhledávání - "Charpentier, Clément"

Report

A Connected Version of the Graph Coloring Game

Autor: Sopena, Eric, Charpentier, Clément, Hocquard, Hervé, Zhu, Xuding

Publikováno v: Discrete Applied Mathematics, Elsevier

The graph coloring game is a two-player game in which, given a graph G and a set of k colors, the two players, Alice and Bob, take turns coloring properly an uncolored vertex of G, Alice having the first move. Alice wins the game if and only if all t

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

Zobrazit plný text záznamu

Akademický článek

Game-Perfect Semiorientations of Forests

Autor: Andres Stephan Dominique, Charpentier Clément, Fong Wai Lam

Publikováno v: Discussiones Mathematicae Graph Theory, Vol 42, Iss 2, Pp 501-534 (2022)

We consider digraph colouring games where two players, Alice and Bob, alternately colour vertices of a given digraph D with a colour from a given colour set in a feasible way. The game ends when such move is not possible any more. Alice wins if every

Externí odkaz: https://doaj.org/article/8ad5b3b48dc341faa63d196446eec080

Zobrazit plný text záznamu

Dissertation/ Thesis

Coloration, jeux et marquages dans les graphes

Autor: Charpentier, Clément

Nous étudions plusieurs problèmes de coloration dans les graphes, pour certains avec une composante ludique. La coloration à distance 2 d'un graphe est une coloration de ses sommets telle que deux sommets à distance au plus 2 ont des couleurs dif

Externí odkaz: http://www.theses.fr/2014BORD0023/document

Zobrazit plný text záznamu

Report

The Coloring Game on Planar Graphs with Large Girth, by a result on Sparse Cactuses

Autor: Charpentier, Clément

We denote by $\chi$ g (G) the game chromatic number of a graph G, which is the smallest number of colors Alice needs to win the coloring game on G. We know from Montassier et al. [M. Montassier, P. Ossona de Mendez, A. Raspaud and X. Zhu, Decomposing

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

Zobrazit plný text záznamu

Report

Incidence coloring game and arboricity of graphs

Autor: Charpentier, Clément, Sopena, Eric

Publikováno v: International Workshop on Combinatorial Algorithms, Rouen : France (2013)

An incidence of a graph $G$ is a pair $(v,e)$ where $v$ is a vertex of $G$ and $e$ an edge incident to $v$. Two incidences $(v,e)$ and $(w,f)$ are adjacent whenever $v = w$, or $e = f$, or $vw = e$ or $f$. The incidence coloring game [S.D. Andres, Th

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

Zobrazit plný text záznamu