Éric Sopena - RankMe

132 papers B 3C 1Journal 123Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Homomorphisms of (n,m)-graphs with respect to generalised switch. Discret. Math. Theor. Comput. Sci. Sagnik Sen, Éric Sopena, S. Taruni
2024	J	`jnl`	Broadcast independence number of oriented circulant graphs. CoRR Abdelamin Laouar, Isma Bouchemakh, Éric Sopena
2024	J	`jnl`	On the broadcast independence number of circulant graphs. Discret. Math. Algorithms Appl. Abdelamin Laouar, Isma Bouchemakh, Éric Sopena
2024	J	`jnl`	On the broadcast independence number of locally uniform 2-lobsters. Discuss. Math. Graph Theory Messaouda Ahmane, Isma Bouchemakh, Éric Sopena
2024	J	`jnl`	On the oriented achromatic number of graphs. Discret. Appl. Math. Pavan P. D, Éric Sopena
2024	J	`jnl`	Strong incidence colouring of graphs. Discuss. Math. Graph Theory Brahim Benmedjdoub, Éric Sopena
2024	J	`jnl`	Upper Broadcast Domination Number of Caterpillars with no Trunks. Electron. J. Graph Theory Appl. Sabrina Bouchouika, Isma Bouchemakh, Éric Sopena
2024	J	`jnl`	$\boldsymbol{(\alpha, \beta )}$-Modules in Graphs. SIAM J. Discret. Math. Michel Habib, Lalla Mouatadid, Éric Sopena, Mengchuan Zou
2023	J	`jnl`	A Proof of the Multiplicative 1-2-3 Conjecture. Comb. Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
2023	J	`jnl`	Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable. J. Graph Theory Marthe Bonamy, Théo Pierron, Éric Sopena
2022	—	`conf`	A Proof of the Multiplicative 1-2-3 Conjecture. CALDAM Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
2022	J	`jnl`	A note on the neighbour-distinguishing index of digraphs. Ars Math. Contemp. Éric Sopena, Mariusz Wozniak
2022	J	`jnl`	Further evidence towards the multiplicative 1-2-3 Conjecture. Discret. Appl. Math. Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
2022	J	`jnl`	Generalising the achromatic number to Zaslavsky's colourings of signed graphs. Theor. Comput. Sci. Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena
2022	J	`jnl`	Homomorphisms of (n, m)-graphs with respect to generalised switch. CoRR Sagnik Sen, Éric Sopena, S. Taruni
2022	J	`jnl`	On a List Variant of the Multiplicative 1-2-3 Conjecture. Graphs Comb. Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
2022	J	`jnl`	On the signed chromatic number of some classes of graphs. Discret. Math. Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
2021	J	`jnl`	(α, β)-Modules in Graphs. CoRR Michel Habib, Lalla Mouatadid, Éric Sopena, Mengchuan Zou
2021	J	`jnl`	A proof of the Multiplicative 1-2-3 Conjecture. CoRR Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
2021	J	`jnl`	Exact square coloring of subcubic planar graphs. Discret. Appl. Math. Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
2021	J	`jnl`	Generalising the achromatic number to Zaslavsky's colourings of signed graphs. CoRR Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena
2021	J	`jnl`	Homomorphisms of signed graphs: An update. Eur. J. Comb. Reza Naserasr, Éric Sopena, Thomas Zaslavsky
2021	J	`jnl`	On the Broadcast Independence Number of Circulant Graphs. CoRR Abdelamin Laouar, Isma Bouchemakh, Éric Sopena
2021	J	`jnl`	Proper connection and proper-walk connection of digraphs. Appl. Math. Comput. Anna Fiedorowicz, Elzbieta Sidorowicz, Éric Sopena
2021	J	`jnl`	Pushable chromatic number of graphs with degree constraints. Discret. Math. Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena
2020	J	`jnl`	A connected version of the graph coloring game. Discret. Appl. Math. Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu
2020	J	`jnl`	Broadcasts on paths and cycles. Discret. Appl. Math. Sabrina Bouchouika, Isma Bouchemakh, Éric Sopena
2020	J	`jnl`	Distinguishing numbers and distinguishing indices of oriented graphs. Discret. Appl. Math. Kahina Meslem, Éric Sopena
2020	J	`jnl`	Exact square coloring of subcubic planar graphs. CoRR Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
2020	J	`jnl`	From light edges to strong edge-colouring of 1-planar graphs. Discret. Math. Theor. Comput. Sci. Julien Bensmail, François Dross, Hervé Hocquard, Éric Sopena
2020	J	`jnl`	Further Evidence Towards the Multiplicative 1-2-3 Conjecture. CoRR Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
2020	J	`jnl`	Homomorphisms of Sparse Signed Graphs. Electron. J. Comb. Clément Charpentier, Reza Naserasr, Éric Sopena
2020	J	`jnl`	Incidence coloring-cold cases. Discuss. Math. Graph Theory Frantisek Kardos, Mária Maceková, Martina Mockovciaková, Éric Sopena, Roman Soták
2020	J	`jnl`	On the signed chromatic number of some classes of graphs. CoRR Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
2019	J	`jnl`	2-distance colorings of integer distance graphs. Discuss. Math. Graph Theory Brahim Benmedjdoub, Isma Bouchemakh, Éric Sopena
2019	J	`jnl`	A Connected Version of the Graph Coloring Game. CoRR Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu
2019	J	`jnl`	A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discret. Math. Theor. Comput. Sci. Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
2019	J	`jnl`	A note on the neighbour-distinguishing index of digraphs. CoRR Éric Sopena, Mariusz Wozniak
2019	J	`jnl`	Broadcasts on Paths and Cycles. CoRR Sabrina Bouchouika, Isma Bouchemakh, Éric Sopena
2019	J	`jnl`	Distinguishing numbers and distinguishing indices of oriented graphs. CoRR Kahina Meslem, Éric Sopena
2019	J	`jnl`	Edge weights and vertex colours: Minimizing sum count. Discret. Appl. Math. Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena
2019	J	`jnl`	Every planar graph with Δ≥8 is totally (Δ+2)-choosable. CoRR Marthe Bonamy, Théo Pierron, Éric Sopena
2019	J	`jnl`	Incidence choosability of graphs. Discret. Appl. Math. Brahim Benmedjdoub, Isma Bouchemakh, Éric Sopena
2019	J	`jnl`	On the Broadcast Independence Number of Locally Uniform 2-Lobsters. CoRR Messaouda Ahmane, Isma Bouchemakh, Éric Sopena
2019	J	`jnl`	On the distinguishing number of cyclic tournaments: Towards the Albertson-Collins Conjecture. Discret. Appl. Math. Kahina Meslem, Éric Sopena
2019	J	`jnl`	Oriented colourings of graphs with maximum degree three and four. Discret. Math. Christopher Duffy, Gary MacGillivray, Éric Sopena
2019	J	`jnl`	Pushable chromatic number of graphs with degree constraints. CoRR Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Soumyajit Paul, Sagnik Sen, Éric Sopena
2018	J	`jnl`	A Study of k-dipath Colourings of Oriented Graphs. Discret. Math. Theor. Comput. Sci. Christopher Duffy, Gary MacGillivray, Éric Sopena
2018	J	`jnl`	Ice sliding games. Int. J. Game Theory Paul Dorbec, Éric Duchêne, André Fabbri, Julien Moncel, Aline Parreau, Éric Sopena
2018	J	`jnl`	Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture. Discret. Appl. Math. Olivier Baudon, Julien Bensmail, Mohammed Senhaji, Éric Sopena
2018	J	`jnl`	Octal games on graphs: The game 0.33 on subdivided stars and bistars. Theor. Comput. Sci. Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena
2018	J	`jnl`	On the broadcast independence number of caterpillars. Discret. Appl. Math. Messaouda Ahmane, Isma Bouchemakh, Éric Sopena
2018	J	`jnl`	Oriented Colourings of Graphs with Maximum Degree Three and Four. CoRR Christopher Duffy, Gary MacGillivray, Éric Sopena
2018	J	`jnl`	Packing colouring of some classes of cubic graphs. CoRR Laïche Daouya, Éric Sopena
2018	J	`jnl`	Rainbow connections in digraphs. Discret. Appl. Math. Elzbieta Sidorowicz, Éric Sopena
2018	J	`jnl`	Strong rainbow connection in digraphs. Discret. Appl. Math. Elzbieta Sidorowicz, Éric Sopena
2017	J	`jnl`	Equitable neighbour-sum-distinguishing edge and total colourings. CoRR Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
2017	J	`jnl`	Equitable neighbour-sum-distinguishing edge and total colourings. Discret. Appl. Math. Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
2017	J	`jnl`	Incidence Choosability of Graphs. CoRR Brahim Benmedjdoub, Isma Bouchemakh, Éric Sopena
2017	J	`jnl`	Packing coloring of some undirected and oriented coronae graphs. Discuss. Math. Graph Theory Isma Bouchemakh, Laïche Daouya, Éric Sopena
2017	J	`jnl`	The neighbour-sum-distinguishing edge-colouring game. Discret. Math. Olivier Baudon, Jakub Przybylo, Mohammed Senhaji, Elzbieta Sidorowicz, Éric Sopena, Mariusz Wozniak
2016	J	`jnl`	2-Distance Colorings of Integer Distance Graphs. CoRR Brahim Benmedjdoub, Éric Sopena, Isma Bouchemakh
2016	J	`jnl`	A Study of $k$-dipath Colourings of Oriented Graphs. CoRR Christopher Duffy, Gary MacGillivray, Éric Sopena
2016	J	`jnl`	Homomorphisms and colourings of oriented graphs: An updated survey. Discret. Math. Éric Sopena
2016	J	`jnl`	Octal Games on Graphs: The game 0.33 on subdivided stars and bistars. CoRR Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena
2016	J	`jnl`	On the Broadcast Independence Number of Caterpillars. CoRR Messaouda Ahmane, Isma Bouchemakh, Éric Sopena
2016	J	`jnl`	On the Distinguishing Number of Cyclic Tournaments: Towards Albertson-Collins Conjecture. CoRR Kahina Meslem, Éric Sopena
2016	J	`jnl`	On the packing coloring of undirected and oriented generalized theta graphs. Australas. J Comb. Laïche Daouya, Isma Bouchemakh, Éric Sopena
2016	J	`jnl`	Outerplanar and Planar Oriented Cliques. J. Graph Theory Ayan Nandy, Sagnik Sen, Éric Sopena
2016	J	`jnl`	Packing Coloring of Undirected and Oriented Generalized Theta Graphs. CoRR Laïche Daouya, Isma Bouchemakh, Éric Sopena
2016	J	`jnl`	i-Mark: A new subtraction division game. Theor. Comput. Sci. Éric Sopena
2015	J	`jnl`	An oriented version of the 1-2-3 Conjecture. Discuss. Math. Graph Theory Olivier Baudon, Julien Bensmail, Éric Sopena
2015	J	`jnl`	Dicots, and a taxonomic ranking for misère games. J. Comb. Theory A Paul Dorbec, Gabriel Renault, Aaron N. Siegel, Éric Sopena
2015	J	`jnl`	Homomorphisms of Signed Graphs. J. Graph Theory Reza Naserasr, Edita Rollová, Éric Sopena
2015	J	`jnl`	Ice sliding games. CoRR Paul Dorbec, Éric Duchêne, André Fabbri, Julien Moncel, Aline Parreau, Éric Sopena
2015	J	`jnl`	On the complexity of determining the irregular chromatic index of a graph. J. Discrete Algorithms Olivier Baudon, Julien Bensmail, Éric Sopena
2015	J	`jnl`	Packing coloring of some undirected and oriented coronae graphs. CoRR Laïche Daouya, Isma Bouchemakh, Éric Sopena
2015	J	`jnl`	The incidence game chromatic number of (a, d)-decomposable graphs. J. Discrete Algorithms Clément Charpentier, Éric Sopena
2015	J	`jnl`	i-MARK: A New Subtraction Division Game. CoRR Éric Sopena
2014	J	`jnl`	Complete oriented colourings and the oriented achromatic number. Discret. Appl. Math. Éric Sopena
2014	J	`jnl`	Outerplanar and planar oriented cliques. CoRR Ayan Nandy, Sagnik Sen, Éric Sopena
2014	J	`jnl`	Partitioning Harary graphs into connected subgraphs containing prescribed vertices. Discret. Math. Theor. Comput. Sci. Olivier Baudon, Julien Bensmail, Éric Sopena
2014	J	`jnl`	Rainbow connection in oriented graphs. Discret. Appl. Math. Paul Dorbec, Ingo Schiermeyer, Elzbieta Sidorowicz, Éric Sopena
2013	J	`jnl`	Homomorphisms of planar signed graphs to signed projective cubes. Discret. Math. Theor. Comput. Sci. Reza Naserasr, Edita Rollová, Éric Sopena
2013	C	`conf`	Incidence Coloring Game and Arboricity of Graphs. IWOCA Clément Charpentier, Éric Sopena
2013	J	`jnl`	Incidence coloring game and arboricity of graphs CoRR Clément Charpentier, Éric Sopena
2013	J	`jnl`	The incidence chromatic number of toroidal grids. Discuss. Math. Graph Theory Éric Sopena, Jiaojiao Wu
2012	J	`jnl`	Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs. Discuss. Math. Graph Theory Éric Sopena
2010	J	`jnl`	Coloring the square of the Cartesian product of two cycles. Discret. Math. Éric Sopena, Jiaojiao Wu
2010	J	`jnl`	Homomorphisms of 2-edge-colored graphs. Discret. Appl. Math. Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
2010	J	`jnl`	Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs CoRR Éric Sopena
2009	J	`jnl`	Chromatic number of sparse colored mixed planar graphs. Electron. Notes Discret. Math. Amanda Montejano, Alexandre Pinlou, André Raspaud, Éric Sopena
2009	J	`jnl`	Coloring the square of the Cartesian product of two cycles CoRR Éric Sopena, Jiaojiao Wu
2009	J	`jnl`	Compound Node-Kayles on paths. Theor. Comput. Sci. Adrien Guignard, Éric Sopena
2009	J	`jnl`	Incidence coloring of the Cartesian product of two cycles CoRR Éric Sopena, Jiaojiao Wu
2008	J	`jnl`	Compound Node-Kayles on Paths CoRR Adrien Guignard, Éric Sopena
2008	J	`jnl`	Homomorphisms of 2-edge-colored graphs. Electron. Notes Discret. Math. Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
2008	J	`jnl`	On the oriented chromatic index of oriented graphs. J. Graph Theory Pascal Ochem, Alexandre Pinlou, Éric Sopena
2006	J	`jnl`	On the oriented chromatic number of Halin graphs. Inf. Process. Lett. Mohammad Hosseini Dolama, Éric Sopena
2006	J	`jnl`	On the oriented chromatic number of graphs with given excess. Discret. Math. Mohammad Hosseini Dolama, Éric Sopena
2006	J	`jnl`	Oriented vertex and arc colorings of outerplanar graphs. Inf. Process. Lett. Alexandre Pinlou, Éric Sopena
2006	J	`jnl`	The acircuitic directed star arboricity of subcubic graphs is at most four. Discret. Math. Alexandre Pinlou, Éric Sopena
2005	J	`jnl`	On the maximum average degree and the incidence chromatic number of a graph. Discret. Math. Theor. Comput. Sci. Mohammad Hosseini Dolama, Éric Sopena
2004	J	`jnl`	Incidence coloring of k-degenerated graphs. Discret. Math. Mohammad Hosseini Dolama, Éric Sopena, Xuding Zhu
2002	J	`jnl`	Acyclic list 7-coloring of planar graphs. J. Graph Theory Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2002	J	`jnl`	Nilpotent Families of Endomorphisms of (p(V)+, cup). J. Comb. Theory B Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena
2002	J	`jnl`	There exist oriented planar graphs with oriented chromatic number at least sixteen. Inf. Process. Lett. Éric Sopena
2001	J	`jnl`	Acyclic colouring of 1-planar graphs. Discret. Appl. Math. Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2001	J	`jnl`	On Deeply Critical Oriented Graphs. J. Comb. Theory B Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2001	J	`jnl`	On nice graphs. Discret. Math. Pavol Hell, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2001	J	`jnl`	On the Oriented Game Chromatic Number. Electron. J. Comb. Jaroslav Nesetril, Éric Sopena
2001	J	`jnl`	Oriented graph coloring. Discret. Math. Éric Sopena
2001	B	`conf`	Small k-Dominating Sets in Planar Graphs with Applications. WG Cyril Gavoille, David Peleg, André Raspaud, Éric Sopena
1999	J	`jnl`	Acrylic improper colorings of graphs. J. Graph Theory Pierre Boiron, Éric Sopena, Laurence Vignal
1999	J	`jnl`	On the maximum average degree and the oriented chromatic number of a graph. Discret. Math. Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena
1998	J	`jnl`	On universal graphs for planar oriented graphs of a given girth. Discret. Math. Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena
1997	J	`jnl`	Acyclic and oriented chromatic numbers of graphs. J. Graph Theory Alexandr V. Kostochka, Éric Sopena, Xuding Zhu
1997	—	`conf`	Acyclic improper colourings of graphs with bounded degree. Contemporary Trends in Discrete Mathematics Pierre Boiron, Éric Sopena, Laurence Vignal
1997	J	`jnl`	Colorings and girth of oriented planar graphs. Discret. Math. Jarik Nesetril, André Raspaud, Éric Sopena
1997	J	`jnl`	Graph Relabelling Systems: A General Overview. Comput. Artif. Intell. Yves Métivier, Éric Sopena
1997	—	`conf`	On the minimum number of edges giving maximum oriented chromatic number. Contemporary Trends in Discrete Mathematics Alexandr V. Kostochka, Tomasz Luczak, Gábor Simonyi, Éric Sopena
1997	J	`jnl`	The chromatic number of oriented graphs. J. Graph Theory Éric Sopena
1996	J	`jnl`	Expanding Graph Relabeling Systems have the Power of Recursive Enumerability. Fundam. Informaticae Éric Sopena
1995	—	`conf`	Checking global graph properties by means of local computations: the majority problem. SEGRAGRA Igor Litovsky, Yves Métivier, Éric Sopena
1995	J	`jnl`	Different Local Controls for Graph Relabeling Systems. Math. Syst. Theory Igor Litovsky, Yves Métivier, Éric Sopena
1994	J	`jnl`	Good and Semi-Strong Colorings of Oriented Planar Graphs. Inf. Process. Lett. André Raspaud, Éric Sopena
1993	J	`jnl`	Some Combinatorial Aspects of Time-stamp Systems. Eur. J. Comb. Robert Cori, Éric Sopena
1992	B	`conf`	Definitions and Comparisons of Local Computations on Graphs. MFCS Igor Litovsky, Yves Métivier, Éric Sopena
1991	J	`jnl`	Hypermap Rewriting: A Combinatorial Approach. Theor. Comput. Sci. Éric Sopena
1989	B	`conf`	Graph Rewriting Systems with Priorities. WG Michel Billaud, Pierre Lafon, Yves Métivier, Éric Sopena
1988	J	`jnl`	2-Asynchronous Automata. Theor. Comput. Sci. Robert Cori, Éric Sopena, Michel Latteux, Yves Roos
1987	—	`conf`	Combinatorial Hypermap Rewriting. RTA Éric Sopena