default search action
Sylvain Gravier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j105]Sylvain Gravier, Hippolyte Signargout, Souad Slimani
:
Optimal adjacent vertex-distinguishing edge-colorings of circulant graphs. Discuss. Math. Graph Theory 44(4): 1341-1359 (2024) - [j104]Éric Duchêne, Valentin Gledel, Sylvain Gravier, Fionn Mc Inerney
Smash and grab: The 0 ⋅ 6 scoring game on graphs. Theor. Comput. Sci. 990: 114417 (2024) - 2023
- [j103]Wilder P. Mendes, Simone Dantas
A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals. Discret. Appl. Math. 333: 71-81 (2023) - [j102]Sancrey Rodrigues Alves, Fernanda Couto
Partitions and well-coveredness: The graph sandwich problem. Discret. Math. 346(3): 113253 (2023) - [i17]Florian Galliot, Sylvain Gravier, Isabelle Sivignon:
(k-2)-linear connected components in hypergraphs of rank k. CoRR abs/2307.06752 (2023) - [i16]Florian Galliot, Sylvain Gravier, Isabelle Sivignon:
An update on the coin-moving game on the square grid. CoRR abs/2307.06767 (2023) - 2022
- [i15]Florian Galliot, Sylvain Gravier, Isabelle Sivignon:
Structural tools for the Maker-Breaker game. Application to hypergraphs of rank 3: strategies and tractability. CoRR abs/2209.12819 (2022) - 2021
- [c7]Erika Morais Martins Coelho, Hebert Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein:
On the Oriented Coloring of the Disjoint Union of Graphs. IWOCA 2021: 194-207 - [c6]Wilder P. Mendes, Simone Dantas, Sylvain Gravier:
The (a, b)-monochromatic transversal game on biclique-hypergraphs of powers of paths and of powers of cycles. LAGOS 2021: 181-189 - 2020
- [j101]Fernanda Couto
Characterizations, probe and sandwich problems on (k, ℓ)-cographs. Discret. Appl. Math. 281: 118-133 (2020) - [j100]Liliana Alcón, Sylvain Gravier, Cláudia Linhares Sales, Fábio Protti
On clique-inverse graphs of graphs with bounded clique number. J. Graph Theory 94(4): 531-538 (2020) - [c5]Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques. LATIN 2020: 587-599 - [i14]Sylvain Gravier, Hippolyte Signargout, Souad Slimani:
Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs. CoRR abs/2004.12822 (2020)
2010 – 2019
- 2019
- [j99]Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo
Timber game as a counting problem. Discret. Appl. Math. 261: 193-202 (2019) - [j98]Clément Charpentier, Simone Dantas
On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers. Discret. Math. 342(5): 1318-1324 (2019) - [c4]Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier:
On Caterpillars of Game Chromatic Number 4. LAGOS 2019: 461-472 - 2018
- [j97]Sylvain Gravier, Kahina Meslem, Simon Schmidt, Souad Slimani:
Game distinguishing numbers of Cartesian products. Ars Math. Contemp. 14(1): 39-54 (2018) - [j96]Fernanda Couto
On the forbidden induced subgraph probe and sandwich problems. Discret. Appl. Math. 234: 56-66 (2018) - [j95]Fernanda Couto
Chordal-(2, 1) graph sandwich problem with boundary conditions. Electron. Notes Discret. Math. 69: 277-284 (2018) - [j94]Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena
Octal games on graphs: The game 0.33 on subdivided stars and bistars. Theor. Comput. Sci. 746: 19-35 (2018) - 2017
- [j93]Sylvain Gravier, Élise Vandomme
Constant 2-labellings and an application to (r, a, b)-covering codes. Discuss. Math. Graph Theory 37(4): 891-918 (2017) - [j92]Sylvain Gravier, Kahina Meslem, Simon Schmidt, Souad Slimani:
A New Game Invariant of Graphs: the Game Distinguishing Number. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j91]Clément Charpentier, Sylvain Gravier, Thomas Lecorre
Trinque problem: covering complete graphs by plane degree-bounded hypergraphs. J. Comb. Optim. 33(2): 543-550 (2017) - 2016
- [j90]Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. Discret. Appl. Math. 198: 109-117 (2016) - [j89]Méziane Aïder
Relaxed Locally Identifying Coloring of Graphs. Graphs Comb. 32(5): 1651-1665 (2016) - [j88]Sylvain Gravier, Frédéric Maffray, Lucas Pastor:
On the Choosability of Claw-Free Perfect Graphs. Graphs Comb. 32(6): 2393-2413 (2016) - [i13]Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena:
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars. CoRR abs/1612.05772 (2016) - 2015
- [j87]Sylvain Gravier, Aline Parreau, Sara Rottey, Leo Storme
Identifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs. Electron. J. Comb. 22(4): 4 (2015) - [j86]Simone Dantas, Sylvain Gravier, Telma Pará
Solitaire Clobber played on Cartesian product of graphs. Discret. Appl. Math. 182: 84-90 (2015) - [j85]Sylvain Gravier, Michel Mollard, Simon Spacapan, Sara Sabrina Zemljic:
On disjoint hypercubes in Fibonacci cubes. Discret. Appl. Math. 190-191: 50-55 (2015) - [j84]Fernanda Couto
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs. Electron. Notes Discret. Math. 50: 133-138 (2015) - [j83]Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
On weak odd domination and graph-based quantum secret sharing. Theor. Comput. Sci. 598: 129-137 (2015) - [c3]Fernanda Couto
On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs. WG 2015: 312-324 - [i12]Kahina Meslem, Sylvain Gravier, Souad Slimani:
Distinguishing Number and Circulant Graphs. CTW 2015: 9-11 - [i11]Méziane Aïder, Sylvain Gravier, Souad Slimani:
Relaxed Locally Identifying Coloring of Graphs. CTW 2015: 85-88 - [i10]Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier:
Timber Game with Caterpillars. CTW 2015: 93-96 - [i9]Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
On the forbidden induced subgraph probe problem. CTW 2015: 231-234 - 2014
- [j82]Telma Pará
Solitaire clobber on circulant graphs. Discret. Math. 329: 33-41 (2014) - [j81]Sylvain Gravier
Graphs where every k-subset of vertices is an identifying set. Discret. Math. Theor. Comput. Sci. 16(1): 73-88 (2014) - [i8]Sylvain Gravier, Aline Parreau, Sara Rottey, Leo Storme, Élise Vandomme:
Identifying codes in vertex-transitive graphs. CoRR abs/1411.5275 (2014) - 2013
- [j80]Sylvain Gravier, Anne Lacroix, Souad Slimani:
(a, b)-codes in Z/nZ. Discret. Appl. Math. 161(4-5): 612-617 (2013) - [j79]Nadia Brauner
LAD models, trees, and an analog of the fundamental theorem of arithmetic. Discret. Appl. Math. 161(7-8): 909-920 (2013) - [j78]Sylvain Gravier, Matjaz Kovse, Michel Mollard, Julien Moncel, Aline Parreau:
New results on variants of covering codes in Sierpiński graphs. Des. Codes Cryptogr. 69(2): 181-188 (2013) - [j77]Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. Electron. Notes Discret. Math. 44: 195-200 (2013) - [j76]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Identifying Codes in Line Graphs. J. Graph Theory 73(4): 425-448 (2013) - [i7]Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
An oriented 8-coloring for acyclic oriented graphs with maximum degree 3. CTW 2013: 55-58 - 2012
- [j75]Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau:
Locally Identifying Coloring of Graphs. Electron. J. Comb. 19(2): 40 (2012) - [c2]Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
On the Oriented Chromatic Number of Union of Graphs. CTW 2012: 88-91 - [c1]Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
Quantum Secret Sharing with Graph States. MEMICS 2012: 15-31 - [i6]Sylvain Gravier, Matjaz Kovse, Michel Mollard, Julien Moncel, Aline Parreau:
New results on variants of covering codes in Sierpinski graphs. CoRR abs/1201.1202 (2012) - 2011
- [j74]Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel:
Adaptive Identification in Torii in the King Lattice. Electron. J. Comb. 18(1) (2011) - [j73]Olivier Delmas, Sylvain Gravier, Mickaël Montassier, Aline Parreau:
On two variations of identifying codes. Discret. Math. 311(17): 1948-1956 (2011) - [j72]Telma Pará, Simone Dantas, Sylvain Gravier:
Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber. Electron. Notes Discret. Math. 37: 177-182 (2011) - [j71]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Edge identifying codes. Electron. Notes Discret. Math. 38: 343-348 (2011) - [i5]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Identifying codes in line graphs. CoRR abs/1107.0207 (2011) - [i4]Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
Optimal accessing and non-accessing structures for graph protocols. CoRR abs/1109.6181 (2011) - [i3]Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
On Weak Odd Domination and Graph-based Quantum Secret Sharing. CoRR abs/1112.2495 (2011) - 2010
- [j70]Laurent Beaudou, Sylvain Gravier
Covering codes in Sierpinski graphs. Discret. Math. Theor. Comput. Sci. 12(3): 63-74 (2010) - [j69]Paul Dorbec
Paired-Domination in Subdivided Star-Free Graphs. Graphs Comb. 26(1): 43-49 (2010) - [i2]Olivier Delmas, Sylvain Gravier, Mickaël Montassier, Aline Parreau:
On two variations of identifying codes. CoRR abs/1004.4063 (2010) - [i1]Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau:
Locally identifying coloring of graphs. CoRR abs/1010.5624 (2010)
2000 – 2009
- 2009
- [j68]Éric Duchêne, Aviezri S. Fraenkel, Sylvain Gravier, Richard J. Nowakowski:
Another bridge between Nim and Wythoff. Australas. J Comb. 44: 43-56 (2009) - [j67]Éric Duchêne, Sylvain Gravier, Mehdi Mhalla:
Combinatorial graph games. Ars Comb. 90 (2009) - [j66]Paul Dorbec
Weighted codes in Lee metrics. Des. Codes Cryptogr. 52(2): 209-218 (2009) - [j65]Éric Duchêne, Sylvain Gravier:
Geometrical extensions of Wythoff's game. Discret. Math. 309(11): 3595-3608 (2009) - [j64]Méziane Aïder
Isometric embeddings of subdivided connected graphs into hypercubes. Discret. Math. 309(22): 6402-6407 (2009) - [j63]Laurent Beaudou, Paul Dorbec
On Planarity of Direct Product of multipartite Complete Graphs. Discret. Math. Algorithms Appl. 1(1): 85-104 (2009) - [j62]Laurent Beaudou, Sylvain Gravier, Kahina Meslem:
Subdivided graphs as isometric subgraphs of Hamming graphs. Eur. J. Comb. 30(5): 1062-1070 (2009) - [j61]Paul Dorbec
Weighted perfect codes in Lee metric. Electron. Notes Discret. Math. 34: 477-481 (2009) - [j60]Telma Pará, Sylvain Gravier, Simone Dantas:
Impartial Solitaire Clobber played on Powers of Paths. Electron. Notes Discret. Math. 35: 257-262 (2009) - [j59]Éric Duchêne, Sylvain Gravier, Julien Moncel:
New results about impartial solitaire clobber. RAIRO Oper. Res. 43(4): 463-482 (2009) - 2008
- [j58]Sylvain Gravier, Ralf Klasing, Julien Moncel:
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs. Algorithmic Oper. Res. 3(1) (2008) - [j57]Sylvain Gravier, Julien Moncel, Ahmed Semri:
Identifying Codes of Cartesian Product of Two Cliques of the Same Size. Electron. J. Comb. 15(1) (2008) - [j56]Mohamed El-Zahar, Sylvain Gravier, Antoaneta Klobucar:
On the total domination number of cross products of graphs. Discret. Math. 308(10): 2025-2029 (2008) - [j55]Paul Dorbec
Paired-Domination in P 5-Free Graphs. Graphs Comb. 24(4): 303-308 (2008) - [j54]Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel:
Adaptive identification in graphs. J. Comb. Theory A 115(7): 1114-1126 (2008) - [j53]Paul Dorbec
Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs. J. Graph Theory 59(1): 34-44 (2008) - [j52]Laurent Beaudou, Sylvain Gravier, Kahina Meslem:
Isometric Embeddings of Subdivided Complete Graphs in the Hypercube. SIAM J. Discret. Math. 22(3): 1226-1238 (2008) - 2007
- [j51]Sylvain Gravier, Julien Moncel:
On graphs having a V\{x} set as an identifying code. Discret. Math. 307(3-5): 432-434 (2007) - [j50]Sylvain Gravier, Julien Moncel, Charles Payan:
A generalization of the pentomino exclusion problem: Dislocation of graphs. Discret. Math. 307(3-5): 435-444 (2007) - [j49]Laurent Beaudou, Sylvain Gravier, Kahina Meslem:
Isometric embeddings of subdivided complete graphs in the hypercube. Electron. Notes Discret. Math. 29: 277-281 (2007) - [j48]Paul Dorbec
Paired-domination in generalized claw-free graphs. J. Comb. Optim. 14(1): 1-7 (2007) - 2006
- [j47]Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel:
A linear algorithm for minimum 1-identifying codes in oriented trees. Discret. Appl. Math. 154(8): 1246-1253 (2006) - [j46]Luérbio Faria, Celina M. H. de Figueiredo
On maximum planar induced subgraphs. Discret. Appl. Math. 154(13): 1774-1782 (2006) - [j45]Simone Dantas, Celina M. H. de Figueiredo
Extended skew partition problem. Discret. Math. 306(19-20): 2438-2449 (2006) - [j44]Paul Dorbec, Sylvain Gravier, Sandi Klavzar, Simon Spacapan:
Some results on total domination in direct products of graphs. Discuss. Math. Graph Theory 26(1): 103-112 (2006) - [j43]Sylvain Gravier, Julien Moncel, Ahmed Semri:
Identifying codes of cycles. Eur. J. Comb. 27(5): 767-776 (2006) - [j42]Méziane Aïder
Isometric embedding of subdivided Connected graphs in the hypercube. Electron. Notes Discret. Math. 24: 145-151 (2006) - [j41]Sylvain Gravier, Philippe Jorrand, Mehdi Mhalla, Charles Payan:
Quantum Octal Games. Int. J. Found. Comput. Sci. 17(4): 919-932 (2006) - 2005
- [j40]Sylvain Gravier, Julien Moncel:
Construction of Codes Identifying Sets of Vertices. Electron. J. Comb. 12 (2005) - [j39]Éric Duchêne, Sylvain Gravier, Mehdi Mhalla:
Around Wythoff's game. Electron. Notes Discret. Math. 22: 167-172 (2005) - [j38]C. N. Campos
2K2-Partition Problem. Electron. Notes Discret. Math. 22: 217-221 (2005) - [j37]Simone Dantas, Celina M. H. de Figueiredo
Finding H-partitions efficiently. RAIRO Theor. Informatics Appl. 39(1): 133-144 (2005) - 2004
- [j36]Simone Dantas, Sylvain Gravier, Frédéric Maffray:
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. Discret. Appl. Math. 141(1-3): 93-101 (2004) - [j35]Simone Dantas, Celina M. H. de Figueiredo
Stable skew partition problem. Discret. Appl. Math. 143(1-3): 17-22 (2004) - [j34]Sylvain Gravier, Frédéric Maffray:
On the choice number of claw-free perfect graphs. Discret. Math. 276(1-3): 211-218 (2004) - [j33]Sylvain Gravier, Jeannette C. M. Janssen
Graph covers using t-colourable vertex sets. Discret. Math. 278(1-3): 61-80 (2004) - [j32]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) - [j31]Luérbio Faria, Celina M. H. de Figueiredo
Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a I-approximation for finding maximum planar induced subgraphs. Electron. Notes Discret. Math. 18: 121-126 (2004) - [j30]Sylvain Gravier, Fábio Protti, Cláudia Linhares Sales
On Clique-inverse graphs of Kp-free graphs. Electron. Notes Discret. Math. 18: 139-143 (2004) - [j29]Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö:
Coloring the Maximal Cliques of Graphs. SIAM J. Discret. Math. 17(3): 361-376 (2004) - [j28]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
- [j27]Sylvain Gravier, Frédéric Maffray, Bojan Mohar:
On a list-coloring problem. Discret. Math. 268(1-3): 303-308 (2003) - [j26]Sylvain Gravier, Sandi Klavzar
Isometric embeddings of subdivided wheels in hypercubes. Discret. Math. 269(1-3): 287-293 (2003) - [j25]Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray:
Coloring the hypergraph of maximal cliques of a graph with no long path. Discret. Math. 272(2-3): 285-290 (2003) - [j24]Claude Benzaken, Sylvain Gravier, Riste Skrekovski:
Hajós' theorem for list colorings of hypergraphs. Discuss. Math. Graph Theory 23(2): 207-213 (2003) - [j23]Sylvain Gravier, Mehdi Mhalla, Eric Tannier:
On a modular domination game. Theor. Comput. Sci. 306(1-3): 291-303 (2003) - 2002
- [j22]Sylvain Gravier, Daniel Kobler, Wieslaw Kubiak:
Complexity of list coloring problems with a fixed total number of colors. Discret. Appl. Math. 117(1-3): 65-79 (2002) - [j21]Sylvain Gravier:
Total domination number of grid graphs. Discret. Appl. Math. 121(1-3): 119-128 (2002) - [j20]Sylvain Gravier, Charles Payan:
Flips Signés et Triangulations d'un Polygone. Eur. J. Comb. 23(7): 817-821 (2002) - [j19]Shalom Eliahou
Three Moves on Signed Surface Triangulations. J. Comb. Theory B 84(1): 118-125 (2002) - 2001
- [j18]Rachid Chérifi, Sylvain Gravier, Ismaïl Zighem:
Bounds on domination number of complete grid graphs. Ars Comb. 60 (2001) - [j17]Sylvain Gravier, Charles Payan:
On the Pentomino Exclusion Problem. Discret. Comput. Geom. 26(3): 375-386 (2001) - [j16]Celina M. H. de Figueiredo
On Tucker's proof of the strong perfect graph conjecture for (K4-e)-free graphs. Discret. Math. 232(1-3): 105-108 (2001) - [j15]Sylvain Gravier, Michel Mollard, Charles Payan:
On the nonexistence of three-dimensional tiling in the Lee metric II. Discret. Math. 235(1-3): 151-157 (2001) - [j14]Simone Dantas, Sylvain Gravier, Frédéric Maffray, Bojan Mohar:
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. Electron. Notes Discret. Math. 7: 22-25 (2001) - 2000
- [j13]Méziane Aïder
Critical graphs for clique-coloring. Electron. Notes Discret. Math. 5: 3-6 (2000)
1990 – 1999
- 1999
- [j12]Rachid Chérifi, Sylvain Gravier, Xavier Lagraula, Charles Payan, Ismaïl Zighem:
Domination Number of the Cross Product of Paths. Discret. Appl. Math. 94(1-3): 101-139 (1999) - [j11]Moshe Dror, Gerd Finke, Sylvain Gravier, Wieslaw Kubiak:
On the complexity of a restricted list-coloring problem. Discret. Math. 195(1-3): 103-109 (1999) - [j10]Sylvain Gravier:
On Tucker vertices of graphs. Discret. Math. 203(1-3): 121-131 (1999) - 1998
- [j9]Hacène Aït Haddadène
An algorithm for coloring some perfect graphs. Discret. Math. 183(1-3): 1-16 (1998) - [j8]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) - [j7]Sylvain Gravier, Frédéric Maffray:
Graphs whose choice number is equal to their chromatic number. J. Graph Theory 27(2): 87-97 (1998) - 1997
- [j6]Sylvain Gravier, Michel Mollard:
On Domination Numbers of Cartesian Product of Paths. Discret. Appl. Math. 80(2-3): 247-250 (1997) - [j5]Sylvain Gravier, Frédéric Maffray:
Choice number of 3-colorable elementary graphs. Discret. Math. 165-166: 353-358 (1997) - [j4]Sylvain Gravier:
Hamiltonicity of the cross product of two Hamiltonian graphs. Discret. Math. 170(1-3): 253-257 (1997) - 1996
- [j3]Sylvain Gravier:
A Hajós-like theorem for list coloring. Discret. Math. 152(1-3): 299-302 (1996) - [j2]Hacène Aït Haddadène
On weakly diamond-free Berge graphs. Discret. Math. 159(1-3): 237-240 (1996) - 1995
- [j1]Sylvain Gravier, Abdelkader Khelladi:
On the domination number of cross products of graphs. Discret. Math. 145(1-3): 273-277 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: