Brice Effantin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Brice Effantin has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Hamamache Kheddouci
Université Claude Bernard Lyon 1
3 shared publications - Abdelmalek Habi
Université de Lyon, Université Lyon 1, CNRS LIRIS, UMR 5205
1 shared publication - Eric Duchêne
Org pour l'hébergement en libre accès de l
1 shared publication - Hamida Seba
Claude Bernard University Lyon 1
1 shared publication J. P. Boutin
1 shared publicationLyes Dekar
Université de Lyon, CNRS, Université Lyon 1, LIRIS, UMR5205, Lyon, France
1 shared publication
Latest Publications
- Open Access
- 9 January 2026
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 9 (3) , #P3.07
On the partial Grundy coloring of graphs
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- 9 January 2026
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 9 (3) , #P3.07
Open AccessOn the partial Grundy coloring of graphs
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- 27 September 2019
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 9 (1) , 55
Diversified top-k search with relaxed graph simulation
- 27 September 2019
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 9 (1) , 55
Diversified top-k search with relaxed graph simulation
- 13 August 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (5) , 1135-1147
[r, s, t]-Colorings of Graph Products
- 13 August 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (5) , 1135-1147
[r, s, t]-Colorings of Graph Products
- Open Access
- 5 January 2010
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 17 (1) , R173
New Results about Set Colorings of Graphs
The set coloring problem is a new kind of both vertex and edge coloring of a graph introduced by Suresh Hegde in 2009. Only large bounds have been given on the chromatic number for general graphs. In this paper, we consider the problem on paths and complete binary trees, and show that it can be reduced to the computation of a transversal in a special Latin square, i.e., the XOR table. We then investigate a variation of the problem called strong set coloring, and we provide an exhaustive list of all graphs being strongly set colorable with at most 4 colors.
- 5 January 2010
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 17 (1) , R173
Open AccessNew Results about Set Colorings of Graphs
The set coloring problem is a new kind of both vertex and edge coloring of a graph introduced by Suresh Hegde in 2009. Only large bounds have been given on the chromatic number for general graphs. In this paper, we consider the problem on paths and complete binary trees, and show that it can be reduced to the computation of a transversal in a special Latin square, i.e., the XOR table. We then investigate a variation of the problem called strong set coloring, and we provide an exhaustive list of all graphs being strongly set colorable with at most 4 colors.