Eric Sopena
Présentation
Publications
Publications
|
|
On a List Variant of the Multiplicative 1-2-3 ConjectureGraphs and Combinatorics, 2022, 38 (3), pp.88. ⟨10.1007/s00373-022-02491-1⟩ |
|
|
On the signed chromatic number of some classes of graphsDiscrete Mathematics, 2022, 345 (2), pp.112664. ⟨10.1016/j.disc.2021.112664⟩ |
|
|
Further Evidence Towards the Multiplicative 1-2-3 ConjectureDiscrete Applied Mathematics, 2022, 307, pp.135-144. ⟨10.1016/j.dam.2021.10.014⟩ |
|
|
Exact square coloring of subcubic planar graphsDiscrete Applied Mathematics, 2021, 293, pp.74-89. ⟨10.1016/j.dam.2021.01.007⟩ |
|
|
Homomorphisms of signed graphs: An updateEuropean Journal of Combinatorics, 2021, ⟨10.1016/j.ejc.2020.103222⟩ |
|
|
Pushable chromatic number of graphs with degree constraintsDiscrete Mathematics, 2021, 344 (1), pp.112151. ⟨10.1016/j.disc.2020.112151⟩ |
|
|
Homomorphisms of sparse signed graphsThe Electronic Journal of Combinatorics, 2020, 27 (3), ⟨10.37236/8478⟩ |
|
|
Distinguishing numbers and distinguishing indices of oriented graphsDiscrete Applied Mathematics, 2020, 285, pp.330-342. ⟨10.1016/j.dam.2020.06.007⟩ |
|
|
Broadcasts on Paths and CyclesDiscrete Applied Mathematics, 2020, 283, pp.375-395. ⟨10.1016/j.dam.2020.01.030⟩ |
|
|
From light edges to strong edge-colouring of 1-planar graphsDiscrete Mathematics and Theoretical Computer Science, 2020, vol. 22 no. 1 (2), ⟨10.23638/DMTCS-22-1-2⟩ |
|
|
A Connected Version of the Graph Coloring GameDiscrete Applied Mathematics, In press, 283, pp.744-750. ⟨10.1016/j.dam.2020.03.012⟩ |
|
|
Incidence coloring - Cold casesDiscussiones Mathematicae Graph Theory, 2020, 40 (1), pp.345-354. ⟨10.7151/dmgt.2140⟩ |
|
|
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositionsDiscrete Mathematics and Theoretical Computer Science, 2019, ICGT 2018, vol. 21 no. 1, ICGT 2018 (1), ⟨10.23638/DMTCS-21-1-2⟩ |
|
|
On the Distinguishing Number of Cyclic Tournaments: Towards the Albertson-Collins ConjectureDiscrete Applied Mathematics, 2019, 266, pp.219-236 |
|
|
Edge Weights and Vertex Colours: Minimizing Sum CountDiscrete Applied Mathematics, 2019, 270, pp.13-24 |
Every planar graph with \(Δ\)\(≥q\)8 is totally (\(Δ\)+2)-choosableComputing Research Repository, 2019, abs/1904.12060 |
|
|
|
Oriented colourings of graphs with maximum degree three and fourDiscrete Mathematics, 2019, 342 (4), pp.959-974. ⟨10.1016/j.disc.2018.10.008⟩ |
|
|
2-Distance Colorings of Integer Distance GraphsDiscussiones Mathematicae Graph Theory, 2019, 39, pp.589-603 |
|
|
Incidence Choosability of GraphsDiscrete Applied Mathematics, 2019, 265, pp.40-55 |
A Study of k-dipath Colourings of Oriented GraphsDiscrete Mathematics and Theoretical Computer Science, 2018, 20 (1), pp.#6 |
|
|
|
On the Broadcast Independence Number of CaterpillarsDiscrete Applied Mathematics, 2018, 244, pp.20-35 |
|
|
Packing colouring of some classes of cubic graphsThe Australasian Journal of Combinatorics, 2018, 72 (2), pp.376-404 |
|
|
Neighbour-Sum-2-Distinguishing Edge-Weightings: Doubling the 1-2-3 ConjectureDiscrete Applied Mathematics, 2018, 251 (83-92) |
|
|
Octal Games on Graphs: The game 0.33 on subdivided stars and bistarsTheoretical Computer Science, 2018, 746, pp.19-35. ⟨10.1016/j.tcs.2018.06.018⟩ |
|
|
Ice sliding gamesInternational Journal of Game Theory, 2018, 47 (2), pp.487-508. ⟨10.1007/s00182-017-0607-5⟩ |
Strong Rainbow Connection in DigraphsDiscrete Applied Mathematics, 2018, 238, pp.133-143 |
|
Rainbow Connections in DigraphsDiscrete Applied Mathematics, 2018, 243, pp.248-261 |
|
|
|
On locally irregular decompositions of subcubic graphsOpuscula Mathematica, 2018, 38 (6), pp.795-817 |
|
|
Packing coloring of some undirected and oriented coronae graphsDiscussiones Mathematicae Graph Theory, 2017, 37, pp.665-690 |
|
|
The neighbour-sum-distinguishing edge-colouring gameDiscrete Mathematics, 2017, 340 (7), pp.1564-1572. ⟨10.1016/j.disc.2017.02.019⟩ |
|
|
Equitable neighbour-sum-distinguishing edge and total colouringsDiscrete Applied Mathematics, 2017, 222, pp.40-53 |
|
|
i-MARK: A New Subtraction Division GameTheoretical Computer Science, 2016, 627, pp.90-101 |
|
|
Packing Coloring of Undirected and Oriented Generalized Theta GraphsThe Australasian Journal of Combinatorics, 2016, 66 (2), pp.310-329 |
|
|
Dicots, and a taxonomic ranking for misère gamesJournal of Combinatorial Theory, Series A, 2015, 130, pp.42-63. ⟨10.1016/j.jcta.2014.10.006⟩ |
|
|
On the complexity of determining the irregular chromatic index of a graphJournal of Discrete Algorithms, 2015, 30, pp.113-127 |
|
|
Homomorphisms and colourings of oriented graphs: An updated surveyDiscrete Mathematics, 2015, 339 (7), pp.1993-2005. ⟨10.1016/j.disc.2015.03.018⟩ |
The incidence game chromatic number of (a,d)-decomposable graphsJournal of Discrete Algorithms, 2015, 31, pp.14-25 |
|
Outerplanar and Planar Oriented CliquesJournal of Graph Theory, 2015, 82 (2), pp.165-193 |
|
Homomorphisms of signed graphsJournal of Graph Theory, 2015, 79 (3), pp.178-212. ⟨10.1002/jgt.21817⟩ |
|
|
|
An oriented version of the 1-2-3 ConjectureDiscussiones Mathematicae Graph Theory, 2015, 35, pp.141-156 |
|
|
Partitioning Harary graphs into connected subgraphs containing prescribed verticesDiscrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 3 (3), pp.263-278. ⟨10.46298/dmtcs.641⟩ |
A note on the cubical dimension of new classes of binary treesCzechoslovak Mathematical Journal, 2014, 65 (1), pp.151-160. ⟨10.1007/s10587-015-0165-6⟩ |
|
|
|
Complete oriented colourings and the oriented achromatic numberDiscrete Applied Mathematics, 2014, 173, pp.102-112. ⟨10.1016/j.dam.2014.03.015⟩ |
|
|
The Incidence Chromatic Number of Toroidal GridsDiscussiones Mathematicae Graph Theory, 2013, 33, pp.315-327 |
|
|
Bounds for the (m,n)-mixed chromatic number and the oriented chromatic numberGraph Theory Notes of New York, 2013, LXV, pp.10-14 |
|
|
Homomorphisms of planar signed graphs to signed projective cubesDiscrete Mathematics and Theoretical Computer Science, 2013, 15 (3), pp.1-12 |
|
|
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphsDiscussiones Mathematicae Graph Theory, 2012, 32 (3), pp.517-533 |
|
|
Coloring the square of the Cartesian product of two cyclesDiscrete Mathematics, 2010, 310 (17-18), pp.2327-2333. ⟨10.1016/j.disc.2010.05.011⟩ |
Homomorphisms of 2-edge-colored graphsDiscrete Applied Mathematics, 2010, 158 (12), pp.1365-1379. ⟨10.1016/j.dam.2009.09.017⟩ |
|
|
|
Compound Node-Kayles on PathsTheoretical Computer Science, 2009, 410 (21-23), pp.2033-2044. ⟨10.1016/j.tcs.2008.12.053⟩ |
|
|
On the Oriented Chromatic Index of Oriented GraphsJournal of Graph Theory, 2008, 57 (4), pp.313-332. ⟨10.1002/jgt.20286⟩ |
On the oriented chromatic number of graphs with given excessDiscrete Mathematics, 2006, 306, pp.1342--1350 |
|
|
|
The acircuitic directed star arboricity of subcubic graphs is at most fourDiscrete Mathematics, 2006, 306, pp.3281--3289 |
|
|
Oriented vertex and arc colorings of outerplanar graphsInformation Processing Letters, 2006, 100, pp.97-104 |
|
|
On the maximum average degree and the incidence chromatic number of a graphDiscrete Mathematics and Theoretical Computer Science, 2005, Vol. 7, pp.203-216. ⟨10.46298/dmtcs.349⟩ |
On the oriented chromatic number of Halin graphsInformation Processing Letters, 2005, 98, pp.247--252 |
|
Incidence coloring of k-degenerated graphsDiscrete Mathematics, 2004, 283, pp.121--128 |
|
Acyclic List 7-coloring of Planar GraphsJournal of Graph Theory, 2002, 40, No. 2, pp.83-90 |
|
There exist oriented planar graphs with oriented chromatic number at least sixteenInformation Processing Letters, 2002, 81(6), pp.309-312 |
|
Nilpotent families of endomorphisms of $(P(V)^+,cup)$Journal of Combinatorial Theory, Series B, 2002, 86(1), pp.100-108 |
|
On nice graphsDiscrete Mathematics, 2001, 234 (1-3), pp.39-51 |
|
On the maximum average degree and the oriented chromatic number of a graphDiscrete Mathematics, 1999, 206 (1-3), pp.77-89 |
|
On universal graphs for planar oriented graphs of a given girthDiscrete Mathematics, 1998, 188 (1-3), pp.73-85 |
|
Graph relabelling systems: a general overviewComputers & Artificial Intelligence, 1997, 16, pp.167-185 |
|
Colorings and girth of oriented planar graphsDiscrete Mathematics, 1997, 165-166, pp.519-530 |
|
Different local controls for graph relabelling systemsMathematical Systems Theory, 1995, 28, pp.41-65 |
|
Checking global properties by means of local computations in graphs: the majority problemElectronic Notes in Theoretical Computer Science, 1995, 1, pp.199-206 |
|
|
|
2-Asynchronous AutomataTheoretical Computer Science, 1988, 61, pp.93--102. ⟨10.1016/0304-3975(88)90110-7⟩ |
|
|
A proof of the Multiplicative 1-2-3 ConjectureCALDAM 2022 - 8th Annual International Conference on Algorithms and Discrete Applied Mathematics, Feb 2022, Puducherry, India. pp.3-14, ⟨10.1007/978-3-030-95018-7_1⟩ |
A Connected Version of the Graph Coloring GameThe 9th Slovenian International Conference on Graph Theory, Bledʼ19, 2019, Bled, Slovenia |
|
Incidence coloring of some special classes of graphs10th International Colloquium on Graph Theory and combinatorics, ICGT'18, 2018, Lyon, France |
|
Incidence coloring of graphs with bounded maximum average degreeThe 6th Gdańsk Workshop on Graph Theory, GWGT'18, 2018, Gdansk, Poland |
|
Every planar graph of maximum degree 8 is totally 10-choosable10th International Colloquium on Graph Theory and combinatorics, ICGT'18, 2018, Lyon, France |
|
Marking game and graph operators10th International Colloquium on Graph Theory and combinatorics, ICGT'18, 2018, Lyon, France |
|
On the Distinguishing Number of Cyclic Tournaments: Towards the Albertson-Collins ConjectureThe Second Malta Conference in Graph Theory and Combinatorics, MCGTC'17, 2017, Qawra, Malta |
|
Packing colouring of some cubic graphsColourings, Independence and Domination, 17th workshop on Graph Theory, CID'17, 2017, Piechowice, Poland |
|
Octal Games on GraphsCombinatorial Game Theory Colloquium II, CGTC 2, Jan 2017, Lisbonne, Portugal |
|
Incidence Choosability of GraphsColourings, Independence and Domination, 17th workshop on Graph Theory, CID'17, 2017, Piechowice, Poland |
|
On the Distinguishing Number of Cyclic Tournaments: Towards the Albertson-Collins ConjectureColourings, Independence and Domination, 17th workshop on Graph Theory, CID'17, 2017, Piechowice, Poland |
|
Graph minor operations for the marking gameBordeaux Graph Workshop BGW'2016, 2016, Bordeaux, France |
|
Packing coloring of circular ladder graphs and generalized H-graphsBordeaux Graph Workshop BGW'2016, 2016, Bordeaux, France |
|
Strong Rainbow Connection in DigraphsBordeaux Graph Workshop BGW'2016, 2016, Bordeaux, France |
|
On the list incidence chromatic number of graphsBordeaux Graph Workshop BGW'2016, 2016, Bordeaux, France |
|
Combinatorial games on graphs (Invited talk)6th Polish Combinatorial Conference, 2016, Będlewo, Poland |
|
Combinatorial games on graphs (Invited talk)6th Polish Combinatorial Conference, 2016, Będlewo, Poland |
|
A Study of k-dipath Colourings of Oriented GraphsBordeaux Graph Workshop BGW'2016, 2016, Bordeaux, France |
|
The neighbour-sum-distinguishing edge-colouring gameBordeaux Graph Workshop BGW'2016, 2016, Bordeaux, France |
|
Incidence coloring of graphs (Invited talk)24th Workshop on Cycles and Colourings, 2015, Nový Smokovec, Slovakia |
|
Homomorphisms and colourings of oriented graphsDiscrete Math Days and Ontario Combinatorics Workshop, 2015, Ottawa, Canada |
|
Homomorphisms of signed bipartite graphsEuropean Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013, Sep 2013, Pisa, Italy. pp.1-5 |
|
Homomorphisms of signed graphsColourings, Independence and Domination 15th WORKSHOP ON GRAPH THEORY, Sep 2013, Szklarska Poręba, Poland |
|
|
|
Incidence coloring game and arboricity of graphsInternational Workshop on Combinatorial Algorithms, Jul 2013, Rouen, France. pp.106-114 |
On homomorphisms of planar signed graphs to signed projective cubesEuropean Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013, Sep 2013, Pisa, Italy. pp.1-5 |
|
Dicots, and a taxonomic ranking for misère gamesEuropean Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013, Sep 2013, Pisa, Italy. pp.1-5 |
|
On the size of graphs that can be partitioned under a given number of prescriptions4th Polish Combinatorial Conference (4PCC), Sep 2012, Będlewo, Poland |
|
CGT Inspired Tools for Studying the Game Chromatic Number of TreesDIMAP Workshop on Combinatorics and Graph Theory 2011, Apr 2011, Warwick, France |
|
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs8th French Combinatorial Conference 8FCC, Jun 2010, Orsay, France |
|
|
|
The chromatic number of sparse colored mixed graphsEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.363-367, ⟨10.1016/j.endm.2009.07.060⟩ |
Homomorphisms of 2-Edge-Colored GraphsIV Latin American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile. pp.33-38, ⟨10.1016/j.endm.2008.01.007⟩ |
|
Colourings of oriented graphsColourings, Independence and Domination - CID'07, Oct 2007, Karpacz, Poland |
|
Definition and comparison of local computations on graphs and networksInternational symposium on Mathematical Foundations of Computer Science (MFCS), 1992, Poland. pp.364-373 |
|
Graph rewriting systems with prioritiesInternational Workshop on Graph-Theoretic Concepts in Computer Science (WG), 1989, Netherlands. pp.94-106 |
Médiation scientifique : de la science informatique au grand publicSociété informatique de France, 2015 |
Graph relabelling systems and distributed algorithmsWorld Scientific. Handbook of graph grammars and computing by graph transformation, H.~{Ehrig} and H.-J.~{Kreowski} and U.~{Montanari} and G.~{Rozenberg}, pp.1-56, 1999 |
|
|
On the Broadcast Independence Number of Circulant Graphs2021 |
|
|
A note on the neighbour-distinguishing index of digraphs2019 |
|
|
Every planar graph with $\Delta\geqslant 8$ is totally $(\Delta+2)$-choosable2019 |
|
|
On the Broadcast Independence Number of Locally Uniform 2-Lobsters2019 |
|
|
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars. Full proof of Theorem 222018 |
Equitable neighbour-sum-distinguishing edge and total colourings2016 |
|
|
The irregular chromatic index of trees2013 |
Homomorphisms of 2-Edge-Colored GraphsRR-08008, 2008, pp.26 |