| 2007 |
|---|
| 39 | EE | Sylvain Gravier,
Julien Moncel:
On graphs having a V\{x} set as an identifying code.
Discrete Mathematics 307(3-5): 432-434 (2007) |
| 38 | EE | Sylvain Gravier,
Julien Moncel,
Charles Payan:
A generalization of the pentomino exclusion problem: Dislocation of graphs.
Discrete Mathematics 307(3-5): 435-444 (2007) |
| 37 | EE | Paul Dorbec,
Sylvain Gravier,
Michael A. Henning:
Paired-domination in generalized claw-free graphs.
J. Comb. Optim. 14(1): 1-7 (2007) |
| 2006 |
|---|
| 36 | EE | Luerbio Faria,
Celina M. Herrera de Figueiredo,
Sylvain Gravier,
Candido Ferreira Xavier de Mendonça Neto,
Jorge Stolfi:
On maximum planar induced subgraphs.
Discrete Applied Mathematics 154(13): 1774-1782 (2006) |
| 35 | EE | Irène Charon,
Sylvain Gravier,
Olivier Hudry,
Antoine Lobstein,
Michel Mollard,
Julien Moncel:
A linear algorithm for minimum 1-identifying codes in oriented trees.
Discrete Applied Mathematics 154(8): 1246-1253 (2006) |
| 34 | EE | Simone Dantas,
Celina M. Herrera de Figueiredo,
Sylvain Gravier,
Sulamita Klein:
Extended skew partition problem.
Discrete Mathematics 306(19-20): 2438-2449 (2006) |
| 33 | EE | Sylvain Gravier,
Julien Moncel,
Ahmed Semri:
Identifying codes of cycles.
Eur. J. Comb. 27(5): 767-776 (2006) |
| 32 | EE | Sylvain Gravier,
Philippe Jorrand,
Mehdi Mhalla,
Charles Payan:
Quantum Octal Games.
Int. J. Found. Comput. Sci. 17(4): 919-932 (2006) |
| 2005 |
|---|
| 31 | EE | Sylvain Gravier,
Julien Moncel:
Construction of Codes Identifying Sets of Vertices.
Electr. J. Comb. 12: (2005) |
| 2004 |
|---|
| 30 | EE | Simone Dantas,
Sylvain Gravier,
Frédéric Maffray:
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
Discrete Applied Mathematics 141(1-3): 93-101 (2004) |
| 29 | EE | Simone Dantas,
Celina M. Herrera de Figueiredo,
Sulamita Klein,
Sylvain Gravier,
Bruce A. Reed:
Stable skew partition problem.
Discrete Applied Mathematics 143(1-3): 17-22 (2004) |
| 28 | EE | Sylvain Gravier,
Frédéric Maffray:
On the choice number of claw-free perfect graphs.
Discrete Mathematics 276(1-3): 211-218 (2004) |
| 27 | EE | Sylvain Gravier,
Jeannette Janssen,
Kyriakos Kilakos,
Sulamita Klein:
Graph covers using t-colourable vertex sets.
Discrete Mathematics 278(1-3): 61-80 (2004) |
| 26 | EE | Sylvain Gravier,
Frédéric Maffray,
Jérôme Renault,
Nicolas Trotignon:
Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets.
Eur. J. Comb. 25(5): 719-734 (2004) |
| 25 | EE | Gábor Bacsó,
Sylvain Gravier,
András Gyárfás,
Myriam Preissmann,
András Sebö:
Coloring the Maximal Cliques of Graphs.
SIAM J. Discrete Math. 17(3): 361-376 (2004) |
| 24 | EE | Marc Daniel,
Sylvain Gravier,
Julien Moncel:
Identifying codes in some subgraphs of the square lattice.
Theor. Comput. Sci. 319(1-3): 411-421 (2004) |
| 2003 |
|---|
| 23 | EE | Sylvain Gravier,
Frédéric Maffray,
Bojan Mohar:
On a list-coloring problem.
Discrete Mathematics 268(1-3): 303-308 (2003) |
| 22 | EE | Sylvain Gravier,
Sandi Klavzar,
Michel Mollard:
Isometric embeddings of subdivided wheels in hypercubes.
Discrete Mathematics 269(1-3): 287-293 (2003) |
| 21 | EE | Sylvain Gravier,
Chính T. Hoàng,
Frédéric Maffray:
Coloring the hypergraph of maximal cliques of a graph with no long path.
Discrete Mathematics 272(2-3): 285-290 (2003) |
| 20 | EE | Sylvain Gravier,
Mehdi Mhalla,
Eric Tannier:
On a modular domination game.
Theor. Comput. Sci. 306(1-3): 291-303 (2003) |
| 2002 |
|---|
| 19 | | Sylvain Gravier,
Daniel Kobler,
Wieslaw Kubiak:
Complexity of list coloring problems with a fixed total number of colors.
Discrete Applied Mathematics 117(1-3): 65-79 (2002) |
| 18 | | Sylvain Gravier:
Total domination number of grid graphs.
Discrete Applied Mathematics 121(1-3): 119-128 (2002) |
| 17 | EE | Sylvain Gravier,
Charles Payan:
Flips Signés et Triangulations d'un Polygone.
Eur. J. Comb. 23(7): 817-821 (2002) |
| 16 | EE | Shalom Eliahou,
Sylvain Gravier,
Charles Payan:
Three Moves on Signed Surface Triangulations.
J. Comb. Theory, Ser. B 84(1): 118-125 (2002) |
| 2001 |
|---|
| 15 | | Rachid Chérifi,
Sylvain Gravier,
Ismaïl Zighem:
Bounds on domination number of complete grid graphs.
Ars Comb. 60: (2001) |
| 14 | EE | Sylvain Gravier,
Charles Payan:
On the Pentomino Exclusion Problem.
Discrete & Computational Geometry 26(3): 375-386 (2001) |
| 13 | EE | Celina M. Herrera de Figueiredo,
Sylvain Gravier,
Cláudia Linhares Sales:
On Tucker's proof of the strong perfect graph conjecture for (K4-e)-free graphs.
Discrete Mathematics 232(1-3): 105-108 (2001) |
| 12 | EE | Sylvain Gravier,
Michel Mollard,
Charles Payan:
On the nonexistence of three-dimensional tiling in the Lee metric II.
Discrete Mathematics 235(1-3): 151-157 (2001) |
| 1999 |
|---|
| 11 | EE | Rachid Chérifi,
Sylvain Gravier,
Xavier Lagraula,
Charles Payan,
Ismaïl Zighem:
Domination Number of the Cross Product of Paths.
Discrete Applied Mathematics 94(1-3): 101-139 (1999) |
| 10 | EE | Moshe Dror,
Gerd Finke,
Sylvain Gravier,
Wieslaw Kubiak:
On the complexity of a restricted list-coloring problem.
Discrete Mathematics 195(1-3): 103-109 (1999) |
| 9 | EE | Sylvain Gravier:
On Tucker vertices of graphs.
Discrete Mathematics 203(1-3): 121-131 (1999) |
| 1998 |
|---|
| 8 | EE | Hacène Aït Haddadène,
Sylvain Gravier,
Frédéric Maffray:
An algorithm for coloring some perfect graphs.
Discrete Mathematics 183(1-3): 1-16 (1998) |
| 7 | EE | Sylvain Gravier,
Michel Mollard,
Charles Payan:
On the Non-existence of 3-Dimensional Tiling in the Lee Metric.
Eur. J. Comb. 19(5): 567-572 (1998) |
| 1997 |
|---|
| 6 | EE | Sylvain Gravier,
Michel Mollard:
On Domination Numbers of Cartesian Product of Paths.
Discrete Applied Mathematics 80(2-3): 247-250 (1997) |
| 5 | EE | Sylvain Gravier,
Frédéric Maffray:
Choice number of 3-colorable elementary graphs.
Discrete Mathematics 165-166: 353-358 (1997) |
| 4 | EE | Sylvain Gravier:
Hamiltonicity of the cross product of two Hamiltonian graphs.
Discrete Mathematics 170(1-3): 253-257 (1997) |
| 1996 |
|---|
| 3 | EE | Sylvain Gravier:
A Hajós-like theorem for list coloring.
Discrete Mathematics 152(1-3): 299-302 (1996) |
| 2 | EE | Hacène Aït Haddadène,
Sylvain Gravier:
On weakly diamond-free Berge graphs.
Discrete Mathematics 159(1-3): 237-240 (1996) |
| 1995 |
|---|
| 1 | EE | Sylvain Gravier,
Abdelkader Khelladi:
On the domination number of cross products of graphs.
Discrete Mathematics 145(1-3): 273-277 (1995) |
