Sylvain Gravier

From MaRDI portal
(Redirected from Person:224198)
Person:189438

Available identifiers

zbMath Open gravier.sylvainMaRDI QIDQ189438

List of research outcomes





PublicationDate of PublicationType
\((k-2)\)-linear connected components in hypergraphs of rank \(k\)2024-09-06Paper
The \((a, b)\)-monochromatic transversal game on clique-hypergraphs of powers of cycles2024-06-05Paper
Transversals in hypergraphs through a new combinatorial game2024-05-06Paper
Timber game with caterpillars2024-04-22Paper
Complexity of the oriented coloring in planar, cubic oriented graphs2024-04-22Paper
On the oriented coloring of the disjoint union of graphs2024-04-14Paper
Smash and grab: the \(0 \cdot 6\) scoring game on graphs2024-02-20Paper
(k-2)-linear connected components in hypergraphs of rank k2023-07-13Paper
An update on the coin-moving game on the square grid2023-07-13Paper
A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals2023-04-27Paper
https://portal.mardi4nfdi.de/entity/Q58818562023-03-13Paper
Partitions and well-coveredness: the graph sandwich problem2023-01-17Paper
Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques2022-10-13Paper
Maker-Breaker is solved in polynomial time on hypergraphs of rank 32022-09-26Paper
On caterpillars of game chromatic number 42022-04-27Paper
On clique-inverse graphs of graphs with bounded clique number2022-03-31Paper
On the oriented coloring of the disjoint union of graphs2022-03-22Paper
Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs2020-05-29Paper
Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs2020-04-27Paper
Timber game as a counting problem2019-05-17Paper
On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers2019-03-25Paper
A new game invariant of graphs: the game distinguishing number2018-11-26Paper
Octal games on graphs: the game 0.33 on subdivided stars and bistars2018-09-27Paper
Game distinguishing numbers of Cartesian products2018-07-18Paper
On the forbidden induced subgraph probe and sandwich problems2017-12-20Paper
Constant 2-labellings and an application to \((r, a, b)\)-covering codes2017-10-13Paper
Twins and Vertex- Identification on Graphs2017-08-10Paper
Trinque problem: covering complete graphs by plane degree-bounded hypergraphs2017-02-22Paper
On the choosability of claw-free perfect graphs2017-01-13Paper
Relaxed locally identifying coloring of graphs2016-11-29Paper
On the complexity of probe and sandwich problems for generalized threshold graphs2016-10-21Paper
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs2016-10-17Paper
Critical graphs for clique-coloring2016-07-01Paper
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs2015-12-07Paper
Identifying codes in vertex-transitive graphs and strongly regular graphs2015-11-02Paper
A survey of Solitaire Clobber2015-10-07Paper
On weak odd domination and graph-based quantum secret sharing2015-09-16Paper
On disjoint hypercubes in Fibonacci cubes2015-07-06Paper
Strong reducibility of solitaire clobber played on Cartesian product of graphs2015-04-09Paper
Solitaire clobber played on Cartesian product of graphs2015-02-06Paper
Solitaire Clobber on circulant graphs2014-06-25Paper
Distinguishing Number for some Circulant Graphs2014-06-15Paper
Graphs where every \(k\)-subset of vertices is an identifying set2014-05-02Paper
Covering codes in Sierpiński graphs2014-02-03Paper
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs2013-12-11Paper
Edge identifying codes2013-11-01Paper
Weighted perfect codes in Lee metric2013-10-10Paper
New results on variants of covering codes in Sierpiński graphs2013-08-05Paper
Identifying codes in line graphs2013-07-31Paper
Strong reducibility of powers of paths and powers of cycles on impartial solitaire clobber2013-07-23Paper
Impartial solitaire clobber played on powers of paths2013-07-19Paper
LAD models, trees, and an analog of the fundamental theorem of arithmetic2013-04-25Paper
\((a,b)\)-codes in \(\mathbb Z/n\mathbb Z\)2013-03-12Paper
Locally identifying coloring of graphs2012-10-24Paper
Optimal accessing and non-accessing structures for graph protocols2011-09-28Paper
On two variations of identifying codes2011-08-09Paper
Adaptive identification in Torii in the King lattice2011-06-01Paper
Combinatorial graph games2011-02-11Paper
Paired-domination in subdivided star-free graphs2010-11-12Paper
https://portal.mardi4nfdi.de/entity/Q35750072010-07-05Paper
Isometric embeddings of subdivided connected graphs into hypercubes2009-12-15Paper
New results about impartial solitaire clobber2009-11-12Paper
Weighted codes in Lee metrics2009-10-14Paper
Isometric Embeddings of Subdivided Complete Graphs in the Hypercube2009-08-20Paper
Another bridge between Nim and Wythoff2009-07-06Paper
ON PLANARITY OF DIRECT PRODUCT OF MULTIPARTITE COMPLETE GRAPHS2009-06-23Paper
Geometrical extensions of Wythoff's game2009-06-19Paper
Subdivided graphs as isometric subgraphs of Hamming graphs2009-06-17Paper
Solitaire Clobber played on Hamming graphs2009-05-26Paper
Paired-domination in \(P_{5}\)-free graphs2009-04-29Paper
Identifying codes of Cartesian product of two cliques of the same size2009-04-07Paper
Adaptive identification in graphs2008-12-08Paper
On the total domination number of cross products of graphs2008-11-12Paper
Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs2008-10-08Paper
Isometric embeddings of subdivided complete graphs in the hypercube2008-06-05Paper
Paired-domination in generalized claw-free graphs2007-11-14Paper
Isometric embedding of subdivided Connected graphs in the hypercube2007-05-29Paper
Around Wythoff's game2007-05-29Paper
2K2-Partition Problem2007-05-29Paper
A generalization of the pentomino exclusion problem: dislocation of graphs2007-02-13Paper
On graphs having a \(V\setminus \{x\}\) set as an identifying code2007-02-13Paper
Extended skew partition problem2006-10-30Paper
Some results on total domination in direct products of graphs2006-10-16Paper
Coloring fiber product of graphs2006-10-12Paper
QUANTUM OCTAL GAMES2006-08-21Paper
A linear algorithm for minimum 1-identifying codes in oriented trees2006-06-30Paper
Codes and \(L(2,1)\)-labelings in Sierpiński graphs2006-06-26Paper
Identifying codes of cycles2006-05-16Paper
A deletion game on graphs: ``Le Pic Arête2006-03-23Paper
https://portal.mardi4nfdi.de/entity/Q57085022005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q54614482005-07-26Paper
FindingH-partitions efficiently2005-06-07Paper
Construction of codes identifying sets of vertices2005-04-25Paper
Coloring the Maximal Cliques of Graphs2005-02-28Paper
Stable skew partition problem2004-11-23Paper
Hajós' theorem for list colorings of hypergraphs2004-10-27Paper
Identifying codes in some subgraphs of the square lattice2004-08-10Paper
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum2004-08-06Paper
Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44616372004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q44616362004-05-18Paper
On a modular domination game.2004-03-14Paper
Graph covers using \(t\)-colourable vertex sets.2004-03-14Paper
On the choice number of claw-free perfect graphs2004-02-14Paper
Coloring the hypergraph of maximal cliques of a graph with no long path2003-11-25Paper
Isometric embeddings of subdivided wheels in hypercubes2003-08-19Paper
On a list-coloring problem2003-07-29Paper
Flips signés et triangulations d'un polygone. (Signed flips and triangulations of a polygon)2003-03-18Paper
Three moves on signed surface triangulations2002-12-10Paper
Total domination number of grid graphs2002-08-29Paper
On the pentomino exclusion problem2002-06-11Paper
Complexity of list coloring problems with a fixed total number of colors2002-05-15Paper
On Tucker's proof of the strong perfect graph conjecture for \((K_4-e)\)-free graphs2002-01-27Paper
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum2001-10-24Paper
On the nonexistence of three-dimensional tiling in the Lee metric. II2001-10-23Paper
Variations on tilings in the Manhattan metric2001-03-04Paper
https://portal.mardi4nfdi.de/entity/Q49343992000-01-17Paper
On Tucker vertices of graphs1999-12-20Paper
Domination number of the cross product of paths1999-10-25Paper
On the complexity of a restricted list-coloring problem1999-08-03Paper
On the non-existence of 3-dimensional tiling in the Lee metric1999-04-08Paper
On domination numbers of Cartesian products of paths1998-10-27Paper
An algorithm for coloring some perfect graphs1998-09-14Paper
https://portal.mardi4nfdi.de/entity/Q43797341998-07-08Paper
Choice number of 3-colorable elementary graphs1998-06-01Paper
Hamiltonicity of the cross product of two Hamiltonian graphs1997-08-10Paper
A Hajós-like theorem for list coloring1996-12-09Paper
On weakly diamond-free Berge graphs1996-12-08Paper
On the domination number of cross products of graphs1996-03-11Paper

Research outcomes over time

This page was built for person: Sylvain Gravier