Combinatorial Hypermap Rewriting. - Éric Sopena (RTA, 1987)

2-Asynchronous Automata. - Robert Cori; Éric Sopena; Michel Latteux; Yves Roos (Theor. Comput. Sci., 1988)

Graph Rewriting Systems with Priorities. - Michel Billaud; Pierre Lafon; Yves Métivier; Éric Sopena (WG, 1989)

Hypermap Rewriting: A Combinatorial Approach. - Éric Sopena (Theor. Comput. Sci., 1991)

Definitions and Comparisons of Local Computations on Graphs. - Igor Litovsky; Yves Métivier; Éric Sopena (MFCS, 1992)

Some Combinatorial Aspects of Time-stamp Systems. - Robert Cori; Éric Sopena (Eur. J. Comb., 1993)

Good and Semi-Strong Colorings of Oriented Planar Graphs. - André Raspaud; Éric Sopena (Inf. Process. Lett., 1994)

Checking global graph properties by means of local computations: the majority problem. - Igor Litovsky; Yves Métivier; Éric Sopena (SEGRAGRA, 1995)

Different Local Controls for Graph Relabeling Systems. - Igor Litovsky; Yves Métivier; Éric Sopena (Math. Syst. Theory, 1995)

Expanding Graph Relabeling Systems have the Power of Recursive Enumerability. - Éric Sopena (Fundam. Informaticae, 1996)

Acyclic improper colourings of graphs with bounded degree. - Pierre Boiron; Éric Sopena; Laurence Vignal (Contemporary Trends in Discrete Mathematics, 1997)

On the minimum number of edges giving maximum oriented chromatic number. - Alexandr V. Kostochka; Tomasz Luczak 001; Gábor Simonyi; Éric Sopena (Contemporary Trends in Discrete Mathematics, 1997)

Graph Relabelling Systems: A General Overview. - Yves Métivier; Éric Sopena (Comput. Artif. Intell., 1997)

Colorings and girth of oriented planar graphs. - Jarik Nesetril; André Raspaud; Éric Sopena (Discret. Math., 1997)

Acyclic and oriented chromatic numbers of graphs. - Alexandr V. Kostochka; Éric Sopena; Xuding Zhu (J. Graph Theory, 1997)

The chromatic number of oriented graphs. - Éric Sopena (J. Graph Theory, 1997)

On universal graphs for planar oriented graphs of a given girth. - Oleg V. Borodin; Alexandr V. Kostochka; Jaroslav Nesetril; André Raspaud; Éric Sopena (Discret. Math., 1998)

On the maximum average degree and the oriented chromatic number of a graph. - Oleg V. Borodin; Alexandr V. Kostochka; Jaroslav Nesetril; André Raspaud; Éric Sopena (Discret. Math., 1999)

Acrylic improper colorings of graphs. - Pierre Boiron; Éric Sopena; Laurence Vignal (J. Graph Theory, 1999)

Small k-Dominating Sets in Planar Graphs with Applications. - Cyril Gavoille; David Peleg; André Raspaud; Éric Sopena (WG, 2001)

On the Oriented Game Chromatic Number. - Jaroslav Nesetril; Éric Sopena (Electron. J. Comb., 2001)

Acyclic colouring of 1-planar graphs. - Oleg V. Borodin; Alexandr V. Kostochka; André Raspaud; Éric Sopena (Discret. Appl. Math., 2001)

On nice graphs. - Pavol Hell; Alexandr V. Kostochka; André Raspaud; Éric Sopena (Discret. Math., 2001)

Oriented graph coloring. - Éric Sopena (Discret. Math., 2001)

On Deeply Critical Oriented Graphs. - Oleg V. Borodin; Dmitry Fon-Der-Flaass; Alexandr V. Kostochka; André Raspaud; Éric Sopena (J. Comb. Theory B, 2001)

There exist oriented planar graphs with oriented chromatic number at least sixteen. - Éric Sopena (Inf. Process. Lett., 2002)

Nilpotent Families of Endomorphisms of (p(V)+, cup). - Dmitry Fon-Der-Flaass; Alexandr V. Kostochka; Jaroslav Nesetril; André Raspaud; Éric Sopena (J. Comb. Theory B, 2002)

Acyclic list 7-coloring of planar graphs. - Oleg V. Borodin; Dmitry Fon-Der-Flaass; Alexandr V. Kostochka; André Raspaud; Éric Sopena (J. Graph Theory, 2002)

Incidence coloring of k-degenerated graphs. - Mohammad Hosseini Dolama; Éric Sopena; Xuding Zhu (Discret. Math., 2004)

On the maximum average degree and the incidence chromatic number of a graph. - Mohammad Hosseini Dolama; Éric Sopena (Discret. Math. Theor. Comput. Sci., 2005)

On the oriented chromatic number of graphs with given excess. - Mohammad Hosseini Dolama; Éric Sopena (Discret. Math., 2006)

The acircuitic directed star arboricity of subcubic graphs is at most four. - Alexandre Pinlou; Éric Sopena (Discret. Math., 2006)

On the oriented chromatic number of Halin graphs. - Mohammad Hosseini Dolama; Éric Sopena (Inf. Process. Lett., 2006)

Oriented vertex and arc colorings of outerplanar graphs. - Alexandre Pinlou; Éric Sopena (Inf. Process. Lett., 2006)

On the oriented chromatic index of oriented graphs. - Pascal Ochem; Alexandre Pinlou; Éric Sopena (J. Graph Theory, 2008)

Incidence coloring of the Cartesian product of two cycles - Éric Sopena; Jiaojiao Wu (CoRR, 2009)

Chromatic number of sparse colored mixed planar graphs. - Amanda Montejano; Alexandre Pinlou; André Raspaud; Éric Sopena (Electron. Notes Discret. Math., 2009)

Compound Node-Kayles on paths. - Adrien Guignard; Éric Sopena (Theor. Comput. Sci., 2009)

Homomorphisms of 2-edge-colored graphs. - Amanda Montejano; Pascal Ochem; Alexandre Pinlou; André Raspaud; Éric Sopena (Discret. Appl. Math., 2010)

Coloring the square of the Cartesian product of two cycles. - Éric Sopena; Jiaojiao Wu (Discret. Math., 2010)

Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs. - Éric Sopena (Discuss. Math. Graph Theory, 2012)

Incidence Coloring Game and Arboricity of Graphs. - Clément Charpentier; Éric Sopena (IWOCA, 2013)

The incidence chromatic number of toroidal grids. - Éric Sopena; Jiaojiao Wu (Discuss. Math. Graph Theory, 2013)

Homomorphisms of planar signed graphs to signed projective cubes. - Reza Naserasr; Edita Rollová; Éric Sopena (Discret. Math. Theor. Comput. Sci., 2013)

Rainbow connection in oriented graphs. - Paul Dorbec; Ingo Schiermeyer; Elzbieta Sidorowicz; Éric Sopena (Discret. Appl. Math., 2014)

Complete oriented colourings and the oriented achromatic number. - Éric Sopena (Discret. Appl. Math., 2014)

Partitioning Harary graphs into connected subgraphs containing prescribed vertices. - Olivier Baudon; Julien Bensmail; Éric Sopena (Discret. Math. Theor. Comput. Sci., 2014)

An oriented version of the 1-2-3 Conjecture. - Olivier Baudon; Julien Bensmail; Éric Sopena (Discuss. Math. Graph Theory, 2015)

Dicots, and a taxonomic ranking for misère games. - Paul Dorbec; Gabriel Renault; Aaron N. Siegel; Éric Sopena (J. Comb. Theory A, 2015)

On the complexity of determining the irregular chromatic index of a graph. - Olivier Baudon; Julien Bensmail; Éric Sopena (J. Discrete Algorithms, 2015)

The incidence game chromatic number of (a, d)-decomposable graphs. - Clément Charpentier; Éric Sopena (J. Discrete Algorithms, 2015)

Homomorphisms of Signed Graphs. - Reza Naserasr; Edita Rollová; Éric Sopena (J. Graph Theory, 2015)

On the packing coloring of undirected and oriented generalized theta graphs. - Laïche Daouya; Isma Bouchemakh; Éric Sopena (Australas. J Comb., 2016)

Homomorphisms and colourings of oriented graphs: An updated survey. - Éric Sopena (Discret. Math., 2016)

Outerplanar and Planar Oriented Cliques. - Ayan Nandy; Sagnik Sen 001; Éric Sopena (J. Graph Theory, 2016)

i-Mark: A new subtraction division game. - Éric Sopena (Theor. Comput. Sci., 2016)

Equitable neighbour-sum-distinguishing edge and total colourings. - Olivier Baudon; Monika Pilsniak; Jakub Przybylo; Mohammed Senhaji; Éric Sopena; Mariusz Wozniak (Discret. Appl. Math., 2017)

The neighbour-sum-distinguishing edge-colouring game. - Olivier Baudon; Jakub Przybylo; Mohammed Senhaji; Elzbieta Sidorowicz; Éric Sopena; Mariusz Wozniak (Discret. Math., 2017)

Packing coloring of some undirected and oriented coronae graphs. - Isma Bouchemakh; Laïche Daouya; Éric Sopena (Discuss. Math. Graph Theory, 2017)

Packing colouring of some classes of cubic graphs. - Laïche Daouya; Éric Sopena (CoRR, 2018)

On the broadcast independence number of caterpillars. - Messaouda Ahmane; Isma Bouchemakh; Éric Sopena (Discret. Appl. Math., 2018)

Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture. - Olivier Baudon; Julien Bensmail; Mohammed Senhaji; Éric Sopena (Discret. Appl. Math., 2018)

Strong rainbow connection in digraphs. - Elzbieta Sidorowicz; Éric Sopena (Discret. Appl. Math., 2018)

Rainbow connections in digraphs. - Elzbieta Sidorowicz; Éric Sopena (Discret. Appl. Math., 2018)

A Study of k-dipath Colourings of Oriented Graphs. - Christopher Duffy 001; Gary MacGillivray; Éric Sopena (Discret. Math. Theor. Comput. Sci., 2018)

Ice sliding games. - Paul Dorbec; Éric Duchêne; André Fabbri; Julien Moncel; Aline Parreau; Éric Sopena (Int. J. Game Theory, 2018)

Octal games on graphs: The game 0.33 on subdivided stars and bistars. - Laurent Beaudou; Pierre Coupechoux; Antoine Dailly; Sylvain Gravier; Julien Moncel; Aline Parreau; Éric Sopena (Theor. Comput. Sci., 2018)

Every planar graph with Δ≥8 is totally (Δ+2)-choosable. - Marthe Bonamy; Théo Pierron; Éric Sopena (CoRR, 2019)

Edge weights and vertex colours: Minimizing sum count. - Olivier Baudon; Julien Bensmail; Hervé Hocquard; Mohammed Senhaji; Éric Sopena (Discret. Appl. Math., 2019)

Incidence choosability of graphs. - Brahim Benmedjdoub; Isma Bouchemakh; Éric Sopena (Discret. Appl. Math., 2019)

On the distinguishing number of cyclic tournaments: Towards the Albertson-Collins Conjecture. - Kahina Meslem; Éric Sopena (Discret. Appl. Math., 2019)

Oriented colourings of graphs with maximum degree three and four. - Christopher Duffy 001; Gary MacGillivray; Éric Sopena (Discret. Math., 2019)

2-distance colorings of integer distance graphs. - Brahim Benmedjdoub; Isma Bouchemakh; Éric Sopena (Discuss. Math. Graph Theory, 2019)

A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. - Olivier Baudon; Julien Bensmail; Tom Davot; Hervé Hocquard; Jakub Przybylo; Mohammed Senhaji; Éric Sopena; Mariusz Wozniak (Discret. Math. Theor. Comput. Sci., 2019)

Homomorphisms of Sparse Signed Graphs. - Clément Charpentier; Reza Naserasr; Éric Sopena (Electron. J. Comb., 2020)

Broadcasts on paths and cycles. - Sabrina Bouchouika; Isma Bouchemakh; Éric Sopena (Discret. Appl. Math., 2020)

A connected version of the graph coloring game. - Clément Charpentier; Hervé Hocquard; Éric Sopena; Xuding Zhu (Discret. Appl. Math., 2020)

Distinguishing numbers and distinguishing indices of oriented graphs. - Kahina Meslem; Éric Sopena (Discret. Appl. Math., 2020)

Incidence coloring-cold cases. - Frantisek Kardos; Mária Maceková; Martina Mockovciaková; Éric Sopena; Roman Soták (Discuss. Math. Graph Theory, 2020)

From light edges to strong edge-colouring of 1-planar graphs. - Julien Bensmail; François Dross; Hervé Hocquard; Éric Sopena (Discret. Math. Theor. Comput. Sci., 2020)

Proper connection and proper-walk connection of digraphs. - Anna Fiedorowicz; Elzbieta Sidorowicz; Éric Sopena (Appl. Math. Comput., 2021)

(α, β)-Modules in Graphs. - Michel Habib; Lalla Mouatadid; Éric Sopena; Mengchuan Zou (CoRR, 2021)

Exact square coloring of subcubic planar graphs. - Florent Foucaud; Hervé Hocquard; Suchismita Mishra 001; Narayanan Narayanan; Reza Naserasr; Éric Sopena; Petru Valicov (Discret. Appl. Math., 2021)

Pushable chromatic number of graphs with degree constraints. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Soumyajit Paul; Théo Pierron; Sagnik Sen 001; Éric Sopena (Discret. Math., 2021)

Homomorphisms of signed graphs: An update. - Reza Naserasr; Éric Sopena; Thomas Zaslavsky (Eur. J. Comb., 2021)

Homomorphisms of (n, m)-graphs with respect to generalised switch. - Sagnik Sen 001; Éric Sopena; S. Taruni (CoRR, 2022)

Further evidence towards the multiplicative 1-2-3 Conjecture. - Julien Bensmail; Hervé Hocquard; Dimitri Lajou; Éric Sopena (Discret. Appl. Math., 2022)

On the signed chromatic number of some classes of graphs. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Théo Pierron; Sagnik Sen 001; Éric Sopena (Discret. Math., 2022)

On a List Variant of the Multiplicative 1-2-3 Conjecture. - Julien Bensmail; Hervé Hocquard; Dimitri Lajou; Éric Sopena (Graphs Comb., 2022)

Generalising the achromatic number to Zaslavsky's colourings of signed graphs. - Julien Bensmail; François Dross; Nacim Oijid; Éric Sopena (Theor. Comput. Sci., 2022)

A note on the neighbour-distinguishing index of digraphs. - Éric Sopena; Mariusz Wozniak (Ars Math. Contemp., 2022)

A Proof of the Multiplicative 1-2-3 Conjecture. - Julien Bensmail; Hervé Hocquard; Dimitri Lajou; Éric Sopena (Comb., 2023)

Every planar graph with Δ ${ rm{ Delta }}$ ⩾ 8 is totally (Δ+2) $({ rm{ Delta }}+2)$-choosable. - Marthe Bonamy; Théo Pierron; Éric Sopena (J. Graph Theory, 2023)

Broadcast independence number of oriented circulant graphs. - Abdelamin Laouar; Isma Bouchemakh; Éric Sopena (CoRR, 2024)

On the oriented achromatic number of graphs. - Pavan P. D; Éric Sopena (Discret. Appl. Math., 2024)

On the broadcast independence number of locally uniform 2-lobsters. - Messaouda Ahmane; Isma Bouchemakh; Éric Sopena (Discuss. Math. Graph Theory, 2024)

Strong incidence colouring of graphs. - Brahim Benmedjdoub; Éric Sopena (Discuss. Math. Graph Theory, 2024)

Upper Broadcast Domination Number of Caterpillars with no Trunks. - Sabrina Bouchouika; Isma Bouchemakh; Éric Sopena (Electron. J. Graph Theory Appl., 2024)

( boldsymbol{( alpha, beta )} )-Modules in Graphs. - Michel Habib; Lalla Mouatadid; Éric Sopena; Mengchuan Zou (SIAM J. Discret. Math., 2024)

On the broadcast independence number of circulant graphs. - Abdelamin Laouar; Isma Bouchemakh; Éric Sopena (Discret. Math. Algorithms Appl., 2024)