The following pages link to Sylvain Gravier (Q189438):
Displaying 50 items.
- (Q224198) (redirect page) (← links)
- Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs (Q324752) (← links)
- Relaxed locally identifying coloring of graphs (Q343700) (← links)
- Locally identifying coloring of graphs (Q456289) (← links)
- On weak odd domination and graph-based quantum secret sharing (Q496043) (← links)
- On the choosability of claw-free perfect graphs (Q503632) (← links)
- Trinque problem: covering complete graphs by plane degree-bounded hypergraphs (Q511700) (← links)
- Adaptive identification in Torii in the King lattice (Q540127) (← links)
- Identifying codes in some subgraphs of the square lattice (Q596073) (← links)
- Paired-domination in subdivided star-free graphs (Q604650) (← links)
- Weighted codes in Lee metrics (Q735023) (← links)
- On graphs having a \(V\setminus \{x\}\) set as an identifying code (Q864130) (← links)
- A generalization of the pentomino exclusion problem: dislocation of graphs (Q864131) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs (Q897592) (← links)
- On the total domination number of cross products of graphs (Q952667) (← links)
- Adaptive identification in graphs (Q958720) (← links)
- Identifying codes of Cartesian product of two cliques of the same size (Q1010656) (← links)
- Paired-domination in \(P_{5}\)-free graphs (Q1014817) (← links)
- Subdivided graphs as isometric subgraphs of Hamming graphs (Q1024304) (← links)
- Geometrical extensions of Wythoff's game (Q1025554) (← links)
- Isometric embeddings of subdivided connected graphs into hypercubes (Q1045174) (← links)
- On weakly diamond-free Berge graphs (Q1126205) (← links)
- On the non-existence of 3-dimensional tiling in the Lee metric (Q1266370) (← links)
- Domination number of the cross product of paths (Q1293195) (← links)
- On the complexity of a restricted list-coloring problem (Q1296975) (← links)
- On Tucker vertices of graphs (Q1301659) (← links)
- Variations on tilings in the Manhattan metric (Q1303807) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- Choice number of 3-colorable elementary graphs (Q1356789) (← links)
- Hamiltonicity of the cross product of two Hamiltonian graphs (Q1363673) (← links)
- On domination numbers of Cartesian products of paths (Q1382283) (← links)
- An algorithm for coloring some perfect graphs (Q1382811) (← links)
- On a list-coloring problem (Q1398274) (← links)
- Isometric embeddings of subdivided wheels in hypercubes (Q1402086) (← links)
- Coloring the hypergraph of maximal cliques of a graph with no long path (Q1412673) (← links)
- On the choice number of claw-free perfect graphs (Q1422425) (← links)
- On a modular domination game. (Q1426455) (← links)
- Graph covers using \(t\)-colourable vertex sets. (Q1427470) (← links)
- Total domination number of grid graphs (Q1613393) (← links)
- On the forbidden induced subgraph probe and sandwich problems (Q1686049) (← links)
- On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers (Q1732763) (← links)
- Construction of codes identifying sets of vertices (Q1773205) (← links)
- Octal games on graphs: the game 0.33 on subdivided stars and bistars (Q1784739) (← links)
- Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets (Q1827343) (← links)
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum (Q1827854) (← links)
- Three moves on signed surface triangulations (Q1850579) (← links)
- Flips signés et triangulations d'un polygone. (Signed flips and triangulations of a polygon) (Q1864594) (← links)
- Stable skew partition problem (Q1887035) (← links)
- On the domination number of cross products of graphs (Q1901047) (← links)
