Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Effantin, Brice"'
Autor:
Bagan, Guillaume, Deschamps, Quentin, Duchêne, Eric, Durain, Bastien, Effantin, Brice, Gledel, Valentin, Oijid, Nacim, Parreau, Aline
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investigated in the literature since then. These games are played on a hypergraph where two players alternately select an unclaimed vertex of it. In the Maker
Externí odkaz:
http://arxiv.org/abs/2211.01083
Autor:
Bagan, Guillaume, Deschamps, Quentin, Duchêne, Eric, Durain, Bastien, Effantin, Brice, Gledel, Valentin, Oijid, Nacim, Parreau, Aline
Publikováno v:
In Discrete Mathematics August 2024 347(8)
Publikováno v:
Discrete Mathematics, Elsevier, 2016, 339 (8)
Gy{\'a}rf{\'a}s et al. and Zaker have proven that the Grundy number of a graph $G$ satisfies $\Gamma(G)\ge t$ if and only if $G$ contains an induced subgraph called a $t$-atom.The family of $t$-atoms has bounded order and contains a finite number of
Externí odkaz:
http://arxiv.org/abs/1505.07780
Publikováno v:
In Discrete Applied Mathematics 19 February 2018 236:73-83
Publikováno v:
In Discrete Mathematics 2010 310(2):260-269
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2018, 236, pp.73-83
Discrete Applied Mathematics, Elsevier, 2018, 236, pp.73-83
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::469ca4cd5cbb71023f25df802619a359
https://hal.archives-ouvertes.fr/hal-01883462
https://hal.archives-ouvertes.fr/hal-01883462
Autor:
Effantin, Brice
Publikováno v:
The Australasian Journal of Combinatorics
The Australasian Journal of Combinatorics, Combinatorial Mathematics Society of Australasia (Inc.), 2017, 68 (3), pp.346-356
The Australasian Journal of Combinatorics, Combinatorial Mathematics Society of Australasia (Inc.), 2017, 68 (3), pp.346-356
International audience; A Grundy coloring of a graph G is a proper vertex coloring of G where any vertex x, colored with c(x), has a neighbor of any color 1,2,...,c(x)-1. A central graph G^c is obtained from G by adding an edge between any two non ad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::98982b0bd3fa277a069132fa4742e8f5
https://hal.archives-ouvertes.fr/hal-01528755
https://hal.archives-ouvertes.fr/hal-01528755
Autor:
Dekar, Lyes1, Effantin, Brice1 brice.effantin-dit-toussaint@univ-lyon1.fr, Kheddouci, Hamamache1 hamamache.kheddouci@univ-lyon1.fr
Publikováno v:
Graphs & Combinatorics. Sep2014, Vol. 30 Issue 5, p1135-1147. 13p.
Autor:
Effantin, Brice1 brice.effantin@u-bourgogne.fr, Kheddouci, Hamamache1 kheddouc@u-bourgogne.fr
Publikováno v:
Discrete Mathematics & Theoretical Computer Science (DMTCS). Dec2003, Vol. 6 Issue 2, p45-54. 10p. 7 Diagrams.
Publikováno v:
Bordeaux Graph Workshop 2014
Bordeaux Graph Workshop 2014, Nov 2014, Bordeaux, France
Bordeaux Graph Workshop 2014, Nov 2014, Bordeaux, France
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e437e832017bd8629442b5f0b5b32bde
https://hal.archives-ouvertes.fr/hal-02174532
https://hal.archives-ouvertes.fr/hal-02174532