Sylvain Gravier

According to our database, Sylvain Gravier authored at least 120 papers between 1995 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

On the oriented coloring of the disjoint union of graphs.

Erika Morais Martins Coelho, Hebert Coelho da Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein

RAIRO Oper. Res., January, 2024

Smash and grab: The 0 ⋅ 6 scoring game on graphs.

Éric Duchêne, Valentin Gledel, Sylvain Gravier, Fionn Mc Inerney, Mehdi Mhalla, Aline Parreau

Theor. Comput. Sci., 2024

The (<i>a, b</i>)-monochromatic transversal game on clique-hypergraphs of powers of cycles.

Wilder P. Mendes, Simone Dantas, Sylvain Gravier

RAIRO Oper. Res., 2024

Optimal adjacent vertex-distinguishing edge-colorings of circulant graphs.

Sylvain Gravier, Hippolyte Signargout, Souad Slimani

Discuss. Math. Graph Theory, 2024

2023

A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals.

Wilder P. Mendes, Simone Dantas, Sylvain Gravier

Discret. Appl. Math., July, 2023

(k - 2)-linear connected components in hypergraphs of rank k.

Florian Galliot, Sylvain Gravier, Isabelle Sivignon

Discret. Math. Theor. Comput. Sci., 2023

Partitions and well-coveredness: The graph sandwich problem.

Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza

Discret. Math., 2023

An update on the coin-moving game on the square grid.

Florian Galliot, Sylvain Gravier, Isabelle Sivignon

CoRR, 2023

2022

Structural tools for the Maker-Breaker game. Application to hypergraphs of rank 3: strategies and tractability.

Florian Galliot, Sylvain Gravier, Isabelle Sivignon

CoRR, 2022

2021

The (a, b)-monochromatic transversal game on biclique-hypergraphs of powers of paths and of powers of cycles.

Wilder P. Mendes, Simone Dantas, Sylvain Gravier

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

On clique-inverse graphs of graphs with bounded clique number.

Liliana Alcón, Sylvain Gravier, Cláudia Linhares Sales, Fábio Protti, Gabriela Ravenna

J. Graph Theory, 2020

Characterizations, probe and sandwich problems on (k, ℓ)-cographs.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos

Discret. Appl. Math., 2020

Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques.

Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

On Caterpillars of Game Chromatic Number 4.

Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers.

Clément Charpentier, Simone Dantas, Celina M. H. de Figueiredo, Ana Luísa C. Furtado, Sylvain Gravier

Discret. Math., 2019

Timber game as a counting problem.

Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier

Discret. Appl. Math., 2019

2018

Octal games on graphs: The game 0.33 on subdivided stars and bistars.

Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena

Theor. Comput. Sci., 2018

Chordal-(2, 1) graph sandwich problem with boundary conditions.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Electron. Notes Discret. Math., 2018

On the forbidden induced subgraph probe and sandwich problems.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Discret. Appl. Math., 2018

Game distinguishing numbers of Cartesian products.

Sylvain Gravier, Kahina Meslem, Simon Schmidt, Souad Slimani

Ars Math. Contemp., 2018

2017

Trinque problem: covering complete graphs by plane degree-bounded hypergraphs.

Clément Charpentier, Sylvain Gravier, Thomas Lecorre

J. Comb. Optim., 2017

A New Game Invariant of Graphs: the Game Distinguishing Number.

Sylvain Gravier, Kahina Meslem, Simon Schmidt, Souad Slimani

Discret. Math. Theor. Comput. Sci., 2017

Constant 2-labellings and an application to <i>(r, a, b)</i>-covering codes.

Sylvain Gravier, Élise Vandomme

Discuss. Math. Graph Theory, 2017

2016

On the Choosability of Claw-Free Perfect Graphs.

Sylvain Gravier, Frédéric Maffray, Lucas Pastor

Graphs Comb., 2016

Relaxed Locally Identifying Coloring of Graphs.

Méziane Aïder, Sylvain Gravier, Souad Slimani

Graphs Comb., 2016

Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs.

Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Discret. Appl. Math., 2016

2015

On weak odd domination and graph-based quantum secret sharing.

Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix

Theor. Comput. Sci., 2015

Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos

Electron. Notes Discret. Math., 2015

On disjoint hypercubes in Fibonacci cubes.

Sylvain Gravier, Michel Mollard, Simon Spacapan, Sara Sabrina Zemljic

Discret. Appl. Math., 2015

Solitaire Clobber played on Cartesian product of graphs.

Simone Dantas, Sylvain Gravier, Telma Pará

Discret. Appl. Math., 2015

Identifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs.

Sylvain Gravier, Aline Parreau, Sara Rottey, Leo Storme, Élise Vandomme

Electron. J. Comb., 2015

On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Distinguishing Number and Circulant Graphs.

Kahina Meslem, Sylvain Gravier, Souad Slimani

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Timber Game with Caterpillars.

Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

On the forbidden induced subgraph probe problem.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Graphs where every k-subset of vertices is an identifying set.

Sylvain Gravier, Svante Janson, Tero Laihonen, Sanna Maarit Ranto

Discret. Math. Theor. Comput. Sci., 2014

Solitaire clobber on circulant graphs.

Telma Pará, Simone Dantas, Sylvain Gravier

Discret. Math., 2014

Identifying codes in vertex-transitive graphs.

Sylvain Gravier, Aline Parreau, Sara Rottey, Leo Storme, Élise Vandomme

CoRR, 2014

2013

Identifying Codes in Line Graphs.

Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov

J. Graph Theory, 2013

New results on variants of covering codes in Sierpiński graphs.

Sylvain Gravier, Matjaz Kovse, Michel Mollard, Julien Moncel, Aline Parreau

Des. Codes Cryptogr., 2013

(<i>a</i>, <i>b</i>)-codes in <i>Z</i>/<i>n</i><i>Z</i>.

Sylvain Gravier, Anne Lacroix, Souad Slimani

Discret. Appl. Math., 2013

LAD models, trees, and an analog of the fundamental theorem of arithmetic.

Nadia Brauner, Sylvain Gravier, Louis-Philippe Kronek, Frédéric Meunier

Discret. Appl. Math., 2013

An oriented 8-coloring for acyclic oriented graphs with maximum degree 3.

Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

Locally Identifying Coloring of Graphs.

Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau

Electron. J. Comb., 2012

Quantum Secret Sharing with Graph States.

Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

On the Oriented Chromatic Number of Union of Graphs.

Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber.

Telma Pará, Simone Dantas, Sylvain Gravier

Electron. Notes Discret. Math., 2011

Edge identifying codes.

Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov

Electron. Notes Discret. Math., 2011

On two variations of identifying codes.

Olivier Delmas, Sylvain Gravier, Mickaël Montassier, Aline Parreau

Discret. Math., 2011

Optimal accessing and non-accessing structures for graph protocols

Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix

CoRR, 2011

Adaptive Identification in Torii in the King Lattice.

Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel

Electron. J. Comb., 2011

2010

Paired-Domination in Subdivided Star-Free Graphs.

Paul Dorbec, Sylvain Gravier

Graphs Comb., 2010

Covering codes in Sierpinski graphs.

Laurent Beaudou, Sylvain Gravier, Sandi Klavzar, Matjaz Kovse, Michel Mollard

Discret. Math. Theor. Comput. Sci., 2010

2009

New results about impartial solitaire clobber.

Éric Duchêne, Sylvain Gravier, Julien Moncel

RAIRO Oper. Res., 2009

Impartial Solitaire Clobber played on Powers of Paths.

Telma Pará, Sylvain Gravier, Simone Dantas

Electron. Notes Discret. Math., 2009

Weighted perfect codes in Lee metric.

Paul Dorbec, Sylvain Gravier, Iiro S. Honkala, Michel Mollard

Electron. Notes Discret. Math., 2009

Subdivided graphs as isometric subgraphs of Hamming graphs.

Laurent Beaudou, Sylvain Gravier, Kahina Meslem

Eur. J. Comb., 2009

On Planarity of Direct Product of multipartite Complete Graphs.

Laurent Beaudou, Paul Dorbec, Sylvain Gravier, Pranava K. Jha

Discret. Math. Algorithms Appl., 2009

Geometrical extensions of Wythoff's game.

Éric Duchêne, Sylvain Gravier

Discret. Math., 2009

Isometric embeddings of subdivided connected graphs into hypercubes.

Méziane Aïder, Sylvain Gravier, Kahina Meslem

Discret. Math., 2009

Weighted codes in Lee metrics.

Paul Dorbec, Sylvain Gravier, Iiro S. Honkala, Michel Mollard

Des. Codes Cryptogr., 2009

Combinatorial graph games.

Éric Duchêne, Sylvain Gravier, Mehdi Mhalla

Ars Comb., 2009

Another bridge between Nim and Wythoff.

Éric Duchêne, Aviezri S. Fraenkel, Sylvain Gravier, Richard J. Nowakowski

Australas. J Comb., 2009

2008

Monochromatic Hamiltonian <i>t</i>-tight Berge-cycles in hypergraphs.

Paul Dorbec, Sylvain Gravier, Gábor N. Sárközy

J. Graph Theory, 2008

Adaptive identification in graphs.

Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel

J. Comb. Theory A, 2008

Paired-Domination in <i>P</i> ₅-Free Graphs.

Paul Dorbec, Sylvain Gravier

Graphs Comb., 2008

On the total domination number of cross products of graphs.

Mohamed El-Zahar, Sylvain Gravier, Antoaneta Klobucar

Discret. Math., 2008

Identifying Codes of Cartesian Product of Two Cliques of the Same Size.

Sylvain Gravier, Julien Moncel, Ahmed Semri

Electron. J. Comb., 2008

Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs.

Sylvain Gravier, Ralf Klasing, Julien Moncel

Algorithmic Oper. Res., 2008

2007

Paired-domination in generalized claw-free graphs.

Paul Dorbec, Sylvain Gravier, Michael A. Henning

J. Comb. Optim., 2007

Isometric embeddings of subdivided complete graphs in the hypercube.

Laurent Beaudou, Sylvain Gravier, Kahina Meslem

Electron. Notes Discret. Math., 2007

A generalization of the pentomino exclusion problem: Dislocation of graphs.

Sylvain Gravier, Julien Moncel, Charles Payan

Discret. Math., 2007

On graphs having a V\{x} set as an identifying code.

Sylvain Gravier, Julien Moncel

Discret. Math., 2007

2006

Quantum Octal Games.

Sylvain Gravier, Philippe Jorrand, Mehdi Mhalla, Charles Payan

Int. J. Found. Comput. Sci., 2006

Isometric embedding of subdivided Connected graphs in the hypercube.

Méziane Aïder, Sylvain Gravier, Kahina Meslem

Electron. Notes Discret. Math., 2006

Identifying codes of cycles.

Sylvain Gravier, Julien Moncel, Ahmed Semri

Eur. J. Comb., 2006

Some results on total domination in direct products of graphs.

Paul Dorbec, Sylvain Gravier, Sandi Klavzar, Simon Spacapan

Discuss. Math. Graph Theory, 2006

Extended skew partition problem.

Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein

Discret. Math., 2006

On maximum planar induced subgraphs.

Luérbio Faria, Celina M. H. de Figueiredo, Sylvain Gravier, Candido Ferreira Xavier de Mendonça Neto, Jorge Stolfi

Discret. Appl. Math., 2006

A linear algorithm for minimum 1-identifying codes in oriented trees.

Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel

Discret. Appl. Math., 2006

2005

Finding H-partitions efficiently.

Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein

RAIRO Theor. Informatics Appl., 2005

Around Wythoff's game.

Éric Duchêne, Sylvain Gravier, Mehdi Mhalla

Electron. Notes Discret. Math., 2005

2K₂-Partition Problem.

C. N. Campos, Simone Dantas, Luérbio Faria, Sylvain Gravier

Electron. Notes Discret. Math., 2005

Construction of Codes Identifying Sets of Vertices.

Sylvain Gravier, Julien Moncel

Electron. J. Comb., 2005

2004

Identifying codes in some subgraphs of the square lattice.

Marc Daniel, Sylvain Gravier, Julien Moncel

Theor. Comput. Sci., 2004

Coloring the Maximal Cliques of Graphs.

Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö

SIAM J. Discret. Math., 2004

On Clique-inverse graphs of K_p-free graphs.

Sylvain Gravier, Fábio Protti, Cláudia Linhares Sales

Electron. Notes Discret. Math., 2004

Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a <i>I</i>-approximation for finding maximum planar induced subgraphs.

Luérbio Faria, Celina M. H. de Figueiredo, Sylvain Gravier, Candido F. X. Mendonça, Jorge Stolfi

Electron. Notes Discret. Math., 2004

Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets.

Sylvain Gravier, Frédéric Maffray, Jérôme Renault, Nicolas Trotignon

Eur. J. Comb., 2004

On the choice number of claw-free perfect graphs.

Sylvain Gravier, Frédéric Maffray

Discret. Math., 2004

Graph covers using t-colourable vertex sets.

Sylvain Gravier, Jeannette C. M. Janssen, Kyriakos Kilakos, Sulamita Klein

Discret. Math., 2004

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.

Simone Dantas, Sylvain Gravier, Frédéric Maffray

Discret. Appl. Math., 2004

Stable skew partition problem.

Simone Dantas, Celina M. H. de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed

Discret. Appl. Math., 2004

2003

On a modular domination game.

Sylvain Gravier, Mehdi Mhalla, Eric Tannier

Theor. Comput. Sci., 2003

Hajós' theorem for list colorings of hypergraphs.

Claude Benzaken, Sylvain Gravier, Riste Skrekovski

Discuss. Math. Graph Theory, 2003

On a list-coloring problem.

Sylvain Gravier, Frédéric Maffray, Bojan Mohar

Discret. Math., 2003

Isometric embeddings of subdivided wheels in hypercubes.

Sylvain Gravier, Sandi Klavzar, Michel Mollard

Discret. Math., 2003

Coloring the hypergraph of maximal cliques of a graph with no long path.

Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray

Discret. Math., 2003

2002

Three Moves on Signed Surface Triangulations.

Shalom Eliahou, Sylvain Gravier, Charles Payan

J. Comb. Theory B, 2002

Flips Signés et Triangulations d'un Polygone.

Sylvain Gravier, Charles Payan

Eur. J. Comb., 2002

Complexity of list coloring problems with a fixed total number of colors.

Sylvain Gravier, Daniel Kobler, Wieslaw Kubiak

Discret. Appl. Math., 2002

Total domination number of grid graphs.

Sylvain Gravier

Discret. Appl. Math., 2002

2001

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.

Simone Dantas, Sylvain Gravier, Frédéric Maffray, Bojan Mohar

Electron. Notes Discret. Math., 2001

On the nonexistence of three-dimensional tiling in the Lee metric II.

Sylvain Gravier, Michel Mollard, Charles Payan

Discret. Math., 2001

On Tucker's proof of the strong perfect graph conjecture for (<i>K</i>₄-<i>e</i>)-free graphs.

Celina M. H. de Figueiredo, Sylvain Gravier, Cláudia Linhares Sales

Discret. Math., 2001

On the Pentomino Exclusion Problem.

Sylvain Gravier, Charles Payan

Discret. Comput. Geom., 2001

Bounds on domination number of complete grid graphs.

Rachid Chérifi, Sylvain Gravier, Ismaïl Zighem

Ars Comb., 2001

2000

Critical graphs for clique-coloring.

Méziane Aïder, Sylvain Gravier

Electron. Notes Discret. Math., 2000

1999

On Tucker vertices of graphs.

Sylvain Gravier

Discret. Math., 1999

On the complexity of a restricted list-coloring problem.

Moshe Dror, Gerd Finke, Sylvain Gravier, Wieslaw Kubiak

Discret. Math., 1999

Domination Number of the Cross Product of Paths.

Rachid Chérifi, Sylvain Gravier, Xavier Lagraula, Charles Payan, Ismaïl Zighem

Discret. Appl. Math., 1999

1998

Graphs whose choice number is equal to their chromatic number.

Sylvain Gravier, Frédéric Maffray

J. Graph Theory, 1998

On the Non-existence of 3-Dimensional Tiling in the Lee Metric.

Sylvain Gravier, Michel Mollard, Charles Payan

Eur. J. Comb., 1998

An algorithm for coloring some perfect graphs.

Hacène Aït Haddadène, Sylvain Gravier, Frédéric Maffray

Discret. Math., 1998

1997

Choice number of 3-colorable elementary graphs.

Sylvain Gravier, Frédéric Maffray

Discret. Math., 1997

Hamiltonicity of the cross product of two Hamiltonian graphs.

Sylvain Gravier

Discret. Math., 1997

On Domination Numbers of Cartesian Product of Paths.

Sylvain Gravier, Michel Mollard

Discret. Appl. Math., 1997

1996

On weakly diamond-free Berge graphs.

Hacène Aït Haddadène, Sylvain Gravier

Discret. Math., 1996

A Hajós-like theorem for list coloring.

Sylvain Gravier

Discret. Math., 1996

1995

On the domination number of cross products of graphs.

Sylvain Gravier, Abdelkader Khelladi

Discret. Math., 1995