Havet Frdric

Frdric Havet

Information about the author Frdric Havet will soon be added to the site.
Found 5 papers in total
On the Grundy and b-Chromatic Numbers of a Graph
On the Grundy and b-Chromatic Numbers of a Graph
2013
The Grundy number of a graph G , denoted by Γ ( G ), is the largest k such that...
On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification Problems
On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification Problems
2013
Given a graph G =( V , E ) and a positive integer k , an edge modification problem for...
The game Grundy number of graphs
The game Grundy number of graphs
2013
Given a graph G =( V , E ), two players, Alice and Bob, alternate their turns in...
Exact Algorithms for L(2,1)‐Labeling of Graphs
Exact Algorithms for L(2,1)‐Labeling of Graphs
2011
The notion of distance constrained graph labelings, motivated by the Frequency...
The Push Tree problem
The Push Tree problem
2004
In this article, we introduce the Push Tree problem, which exposes the tradeoffs...
Papers per page: