Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÉric Sopena
Person information
- affiliation: Université Bordeaux 1, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j78]Julien Bensmail, Hervé Hocquard, Dimitri Lajou
, Éric Sopena:
Further evidence towards the multiplicative 1-2-3 Conjecture. Discret. Appl. Math. 307: 135-144 (2022)- [j77]Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena:
On the signed chromatic number of some classes of graphs. Discret. Math. 345(2): 112664 (2022) - [j76]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
On a List Variant of the Multiplicative 1-2-3 Conjecture. Graphs Comb. 38(3): 88 (2022) - [j75]Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena:
Generalising the achromatic number to Zaslavsky's colourings of signed graphs. Theor. Comput. Sci. 923: 196-221 (2022) - [c9]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
A Proof of the Multiplicative 1-2-3 Conjecture. CALDAM 2022: 3-14 - [i34]Sagnik Sen, Éric Sopena, S. Taruni:
Homomorphisms of (n, m)-graphs with respect to generalised switch. CoRR abs/2204.01258 (2022) - 2021
- [j74]Anna Fiedorowicz, Elzbieta Sidorowicz, Éric Sopena:
Proper connection and proper-walk connection of digraphs. Appl. Math. Comput. 410: 126253 (2021) - [j73]Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov:
Exact square coloring of subcubic planar graphs. Discret. Appl. Math. 293: 74-89 (2021) - [j72]Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena:
Pushable chromatic number of graphs with degree constraints. Discret. Math. 344(1): 112151 (2021) - [j71]Reza Naserasr, Éric Sopena, Thomas Zaslavsky:
Homomorphisms of signed graphs: An update. Eur. J. Comb. 91: 103222 (2021) - [i33]Michel Habib, Lalla Mouatadid, Éric Sopena, Mengchuan Zou:
(α, β)-Modules in Graphs. CoRR abs/2101.08881 (2021) - [i32]Abdelamin Laouar, Isma Bouchemakh, Éric Sopena:
On the Broadcast Independence Number of Circulant Graphs. CoRR abs/2102.04094 (2021) - [i31]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
A proof of the Multiplicative 1-2-3 Conjecture. CoRR abs/2108.10554 (2021) - [i30]Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena:
Generalising the achromatic number to Zaslavsky's colourings of signed graphs. CoRR abs/2109.13627 (2021) - 2020
- [j70]Clément Charpentier, Reza Naserasr, Éric Sopena:
Homomorphisms of Sparse Signed Graphs. Electron. J. Comb. 27(3): 3 (2020) - [j69]Sabrina Bouchouika, Isma Bouchemakh, Éric Sopena:
Broadcasts on paths and cycles. Discret. Appl. Math. 283: 375-395 (2020) - [j68]Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu:
A connected version of the graph coloring game. Discret. Appl. Math. 283: 744-750 (2020) - [j67]Kahina Meslem, Éric Sopena:
Distinguishing numbers and distinguishing indices of oriented graphs. Discret. Appl. Math. 285: 330-342 (2020) - [j66]Frantisek Kardos, Mária Maceková, Martina Mockovciaková, Éric Sopena, Roman Soták:
Incidence coloring-cold cases. Discuss. Math. Graph Theory 40(1): 345-354 (2020) - [j65]Julien Bensmail, François Dross, Hervé Hocquard, Éric Sopena:
From light edges to strong edge-colouring of 1-planar graphs. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [i29]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
Further Evidence Towards the Multiplicative 1-2-3 Conjecture. CoRR abs/2004.09090 (2020) - [i28]Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov:
Exact square coloring of subcubic planar graphs. CoRR abs/2009.00843 (2020) - [i27]Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena:
On the signed chromatic number of some classes of graphs. CoRR abs/2009.12059 (2020)
2010 – 2019
- 2019
- [j64]Brahim Benmedjdoub, Isma Bouchemakh, Éric Sopena:
Incidence choosability of graphs. Discret. Appl. Math. 265: 40-55 (2019) - [j63]Kahina Meslem, Éric Sopena:
On the distinguishing number of cyclic tournaments: Towards the Albertson-Collins Conjecture. Discret. Appl. Math. 266: 219-236 (2019) - [j62]Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena:
Edge weights and vertex colours: Minimizing sum count. Discret. Appl. Math. 270: 13-24 (2019) - [j61]Christopher Duffy, Gary MacGillivray, Éric Sopena:
Oriented colourings of graphs with maximum degree three and four. Discret. Math. 342(4): 959-974 (2019) - [j60]Brahim Benmedjdoub, Isma Bouchemakh, Éric Sopena:
2-distance colorings of integer distance graphs. Discuss. Math. Graph Theory 39(2): 589-603 (2019) - [j59]Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [i26]Messaouda Ahmane, Isma Bouchemakh, Éric Sopena:
On the Broadcast Independence Number of Locally Uniform 2-Lobsters. CoRR abs/1902.02998 (2019) - [i25]Marthe Bonamy, Théo Pierron, Éric Sopena:
Every planar graph with Δ≥8 is totally (Δ+2)-choosable. CoRR abs/1904.12060 (2019) - [i24]Sabrina Bouchouika, Isma Bouchemakh, Éric Sopena:
Broadcasts on Paths and Cycles. CoRR abs/1906.05089 (2019) - [i23]Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu:
A Connected Version of the Graph Coloring Game. CoRR abs/1907.12276 (2019) - [i22]Éric Sopena, Mariusz Wozniak:
A note on the neighbour-distinguishing index of digraphs. CoRR abs/1909.10240 (2019) - [i21]Kahina Meslem, Éric Sopena:
Distinguishing numbers and distinguishing indices of oriented graphs. CoRR abs/1910.12738 (2019) - [i20]Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Soumyajit Paul, Sagnik Sen, Éric Sopena:
Pushable chromatic number of graphs with degree constraints. CoRR abs/1911.09909 (2019) - 2018
- [j58]Elzbieta Sidorowicz, Éric Sopena:
Strong rainbow connection in digraphs. Discret. Appl. Math. 238: 133-143 (2018) - [j57]Elzbieta Sidorowicz, Éric Sopena:
Rainbow connections in digraphs. Discret. Appl. Math. 243: 248-261 (2018) - [j56]Messaouda Ahmane, Isma Bouchemakh, Éric Sopena:
On the broadcast independence number of caterpillars. Discret. Appl. Math. 244: 20-35 (2018) - [j55]Olivier Baudon, Julien Bensmail, Mohammed Senhaji, Éric Sopena:
Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture. Discret. Appl. Math. 251: 83-92 (2018) - [j54]Christopher Duffy, Gary MacGillivray, Éric Sopena:
A Study of k-dipath Colourings of Oriented Graphs. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j53]Paul Dorbec, Éric Duchêne, André Fabbri, Julien Moncel, Aline Parreau, Éric Sopena:
Ice sliding games. Int. J. Game Theory 47(2): 487-508 (2018) - [j52]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) - [i19]Laïche Daouya, Éric Sopena:
Packing colouring of some classes of cubic graphs. CoRR abs/1808.02675 (2018) - [i18]Christopher Duffy, Gary MacGillivray, Éric Sopena:
Oriented Colourings of Graphs with Maximum Degree Three and Four. CoRR abs/1812.05510 (2018) - 2017
- [j51]Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
Equitable neighbour-sum-distinguishing edge and total colourings. Discret. Appl. Math. 222: 40-53 (2017) - [j50]Olivier Baudon, Jakub Przybylo, Mohammed Senhaji, Elzbieta Sidorowicz, Éric Sopena, Mariusz Wozniak:
The neighbour-sum-distinguishing edge-colouring game. Discret. Math. 340(7): 1564-1572 (2017) - [j49]Isma Bouchemakh, Laïche Daouya, Éric Sopena:
Packing coloring of some undirected and oriented coronae graphs. Discuss. Math. Graph Theory 37(3): 665-690 (2017) - [i17]Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
Equitable neighbour-sum-distinguishing edge and total colourings. CoRR abs/1701.04648 (2017) - [i16]Brahim Benmedjdoub, Isma Bouchemakh, Éric Sopena:
Incidence Choosability of Graphs. CoRR abs/1705.01744 (2017) - 2016
- [j48]Laïche Daouya, Isma Bouchemakh, Éric Sopena:
On the packing coloring of undirected and oriented generalized theta graphs. Australas. J Comb. 66: 310-329 (2016) - [j47]Éric Sopena:
Homomorphisms and colourings of oriented graphs: An updated survey. Discret. Math. 339(7): 1993-2005 (2016) - [j46]Ayan Nandy, Sagnik Sen, Éric Sopena:
Outerplanar and Planar Oriented Cliques. J. Graph Theory 82(2): 165-193 (2016) - [j45]Éric Sopena:
i-Mark: A new subtraction division game. Theor. Comput. Sci. 627: 90-101 (2016) - [i15]Brahim Benmedjdoub, Éric Sopena, Isma Bouchemakh:
2-Distance Colorings of Integer Distance Graphs. CoRR abs/1602.09111 (2016) - [i14]Christopher Duffy, Gary MacGillivray, Éric Sopena:
A Study of $k$-dipath Colourings of Oriented Graphs. CoRR abs/1605.08905 (2016) - [i13]Laïche Daouya, Isma Bouchemakh, Éric Sopena:
Packing Coloring of Undirected and Oriented Generalized Theta Graphs. CoRR abs/1606.01107 (2016) - [i12]Kahina Meslem, Éric Sopena:
On the Distinguishing Number of Cyclic Tournaments: Towards Albertson-Collins Conjecture. CoRR abs/1608.04866 (2016) - [i11]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) - [i10]Messaouda Ahmane, Isma Bouchemakh, Éric Sopena:
On the Broadcast Independence Number of Caterpillars. CoRR abs/1612.08283 (2016) - 2015
- [j44]Olivier Baudon, Julien Bensmail, Éric Sopena:
An oriented version of the 1-2-3 Conjecture. Discuss. Math. Graph Theory 35(1): 141-156 (2015) - [j43]Paul Dorbec, Gabriel Renault, Aaron N. Siegel, Éric Sopena:
Dicots, and a taxonomic ranking for misère games. J. Comb. Theory, Ser. A 130: 42-63 (2015) - [j42]Olivier Baudon, Julien Bensmail, Éric Sopena:
On the complexity of determining the irregular chromatic index of a graph. J. Discrete Algorithms 30: 113-127 (2015) - [j41]Clément Charpentier, Éric Sopena:
The incidence game chromatic number of (a, d)-decomposable graphs. J. Discrete Algorithms 31: 14-25 (2015) - [j40]Reza Naserasr, Edita Rollová, Éric Sopena:
Homomorphisms of Signed Graphs. J. Graph Theory 79(3): 178-212 (2015) - [i9]Laïche Daouya, Isma Bouchemakh, Éric Sopena:
Packing coloring of some undirected and oriented coronae graphs. CoRR abs/1506.07248 (2015) - [i8]Paul Dorbec, Éric Duchêne, André Fabbri, Julien Moncel, Aline Parreau, Éric Sopena:
Ice sliding games. CoRR abs/1507.00559 (2015) - [i7]Éric Sopena:
i-MARK: A New Subtraction Division Game. CoRR abs/1509.04199 (2015) - 2014
- [j39]Éric Sopena:
Complete oriented colourings and the oriented achromatic number. Discret. Appl. Math. 173: 102-112 (2014) - [j38]Paul Dorbec, Ingo Schiermeyer, Elzbieta Sidorowicz, Éric Sopena:
Rainbow connection in oriented graphs. Discret. Appl. Math. 179: 69-78 (2014) - [j37]Olivier Baudon, Julien Bensmail, Éric Sopena:
Partitioning Harary graphs into connected subgraphs containing prescribed vertices. Discret. Math. Theor. Comput. Sci. 16(3): 263-278 (2014) - [i6]Ayan Nandy, Sagnik Sen, Éric Sopena:
Outerplanar and planar oriented cliques. CoRR abs/1411.7192 (2014) - 2013
- [j36]Éric Sopena, Jiaojiao Wu:
The incidence chromatic number of toroidal grids. Discuss. Math. Graph Theory 33(2): 315-327 (2013) - [j35]Reza Naserasr, Edita Rollová, Éric Sopena:
Homomorphisms of planar signed graphs to signed projective cubes. Discret. Math. Theor. Comput. Sci. 15(3): 1-12 (2013) - [c8]Clément Charpentier, Éric Sopena:
Incidence Coloring Game and Arboricity of Graphs. IWOCA 2013: 106-114 - [i5]Clément Charpentier, Éric Sopena:
Incidence coloring game and arboricity of graphs. CoRR abs/1304.0166 (2013) - 2012
- [j34]Éric Sopena:
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs. Discuss. Math. Graph Theory 32(3): 517-533 (2012) - 2010
- [j33]Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena:
Homomorphisms of 2-edge-colored graphs. Discret. Appl. Math. 158(12): 1365-1379 (2010) - [j32]Éric Sopena, Jiaojiao Wu:
Coloring the square of the Cartesian product of two cycles. Discret. Math. 310(17-18): 2327-2333 (2010) - [i4]Éric Sopena:
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs. CoRR abs/1005.2816 (2010)
2000 – 2009
- 2009
- [j31]Amanda Montejano, Alexandre Pinlou, André Raspaud, Éric Sopena:
Chromatic number of sparse colored mixed planar graphs. Electron. Notes Discret. Math. 34: 363-367 (2009) - [j30]Adrien Guignard, Éric Sopena:
Compound Node-Kayles on paths. Theor. Comput. Sci. 410(21-23): 2033-2044 (2009) - [i3]Éric Sopena, Jiaojiao Wu:
Coloring the square of the Cartesian product of two cycles. CoRR abs/0906.1126 (2009) - [i2]Éric Sopena, Jiaojiao Wu:
Incidence coloring of the Cartesian product of two cycles. CoRR abs/0907.3801 (2009) - 2008
- [j29]Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena:
Homomorphisms of 2-edge-colored graphs. Electron. Notes Discret. Math. 30: 33-38 (2008) - [j28]Pascal Ochem, Alexandre Pinlou, Éric Sopena:
On the oriented chromatic index of oriented graphs. J. Graph Theory 57(4): 313-332 (2008) - [i1]Adrien Guignard, Éric Sopena:
Compound Node-Kayles on Paths. CoRR abs/0806.3033 (2008) - 2006
- [j27]Mohammad Hosseini Dolama, Éric Sopena:
On the oriented chromatic number of graphs with given excess. Discret. Math. 306(13): 1342-1350 (2006) - [j26]Alexandre Pinlou, Éric Sopena:
The acircuitic directed star arboricity of subcubic graphs is at most four. Discret. Math. 306(24): 3281-3289 (2006) - [j25]Mohammad Hosseini Dolama, Éric Sopena:
On the oriented chromatic number of Halin graphs. Inf. Process. Lett. 98(6): 247-252 (2006) - [j24]Alexandre Pinlou, Éric Sopena:
Oriented vertex and arc colorings of outerplanar graphs. Inf. Process. Lett. 100(3): 97-104 (2006) - 2005
- [j23]Mohammad Hosseini Dolama, Éric Sopena:
On the maximum average degree and the incidence chromatic number of a graph. Discret. Math. Theor. Comput. Sci. 7(1): 203-216 (2005) - 2004
- [j22]Mohammad Hosseini Dolama, Éric Sopena, Xuding Zhu:
Incidence coloring of k-degenerated graphs. Discret. Math. 283(1-3): 121-128 (2004) - 2002
- [j21]Éric Sopena:
There exist oriented planar graphs with oriented chromatic number at least sixteen. Inf. Process. Lett. 81(6): 309-312 (2002) - [j20]Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena:
Nilpotent Families of Endomorphisms of (p(V)+, cup). J. Comb. Theory, Ser. B 86(1): 100-108 (2002) - [j19]Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
Acyclic list 7-coloring of planar graphs. J. Graph Theory 40(2): 83-90 (2002) - 2001
- [j18]Jaroslav Nesetril, Éric Sopena:
On the Oriented Game Chromatic Number. Electron. J. Comb. 8(2) (2001) - [j17]Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
Acyclic colouring of 1-planar graphs. Discret. Appl. Math. 114(1-3): 29-41 (2001) - [j16]Éric Sopena:
Oriented graph coloring. Discret. Math. 229(1-3): 359-369 (2001) - [j15]Pavol Hell, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
On nice graphs. Discret. Math. 234(1-3): 39-51 (2001) - [j14]Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
On Deeply Critical Oriented Graphs. J. Comb. Theory, Ser. B 81(1): 150-155 (2001) - [c7]Cyril Gavoille, David Peleg, André Raspaud, Éric Sopena:
Small k-Dominating Sets in Planar Graphs with Applications. WG 2001: 201-216
1990 – 1999
- 1999
- [j13]Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena:
On the maximum average degree and the oriented chromatic number of a graph. Discret. Math. 206(1-3): 77-89 (1999) - [j12]Pierre Boiron, Éric Sopena, Laurence Vignal:
Acrylic improper colorings of graphs. J. Graph Theory 32(1): 97-107 (1999) - 1998
- [j11]Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena:
On universal graphs for planar oriented graphs of a given girth. Discret. Math. 188(1-3): 73-85 (1998) - 1997
- [j10]Yves Métivier, Éric Sopena:
Graph Relabelling Systems: A General Overview. Comput. Artif. Intell. 16(2): 167-185 (1997) - [j9]Jarik Nesetril, André Raspaud, Éric Sopena:
Colorings and girth of oriented planar graphs. Discret. Math. 165-166: 519-530 (1997) - [j8]Alexandr V. Kostochka, Éric Sopena, Xuding Zhu:
Acyclic and oriented chromatic numbers of graphs. J. Graph Theory 24(4): 331-340 (1997) - [j7]Éric Sopena:
The chromatic number of oriented graphs. J. Graph Theory 25(3): 191-205 (1997) - [c6]Pierre Boiron, Éric Sopena, Laurence Vignal:
Acyclic improper colourings of graphs with bounded degree. Contemporary Trends in Discrete Mathematics 1997: 1-9 - [c5]Alexandr V. Kostochka, Tomasz Luczak, Gábor Simonyi, Éric Sopena:
On the minimum number of edges giving maximum oriented chromatic number. Contemporary Trends in Discrete Mathematics 1997: 179-182 - 1996
- [j6]Éric Sopena:
Expanding Graph Relabeling Systems have the Power of Recursive Enumerability. Fundam. Informaticae 27(1): 1-25 (1996) - 1995
- [j5]Igor Litovsky, Yves Métivier, Éric Sopena:
Different Local Controls for Graph Relabeling Systems. Math. Syst. Theory 28(1): 41-65 (1995) - [c4]Igor Litovsky, Yves Métivier, Éric Sopena:
Checking global graph properties by means of local computations: the majority problem. SEGRAGRA 1995: 199-206 - 1994
- [j4]André Raspaud, Éric Sopena:
Good and Semi-Strong Colorings of Oriented Planar Graphs. Inf. Process. Lett. 51(4): 171-174 (1994) - 1993
- [j3]Robert Cori, Éric Sopena:
Some Combinatorial Aspects of Time-stamp Systems. Eur. J. Comb. 14(2): 95-102 (1993) - 1992
- [c3]Igor Litovsky, Yves Métivier, Éric Sopena:
Definitions and Comparisons of Local Computations on Graphs. MFCS 1992: 364-373 - 1991
- [j2]Éric Sopena:
Hypermap Rewriting: A Combinatorial Approach. Theor. Comput. Sci. 85(2): 253-281 (1991)
1980 – 1989
- 1989
- [c2]Michel Billaud, Pierre Lafon, Yves Métivier, Éric Sopena:
Graph Rewriting Systems with Priorities. WG 1989: 94-106 - 1988
- [j1]Robert Cori, Éric Sopena, Michel Latteux, Yves Roos:
2-Asynchronous Automata. Theor. Comput. Sci. 61: 93-102 (1988) - 1987
- [c1]Éric Sopena:
Combinatorial Hypermap Rewriting. RTA 1987: 62-73