| 2009 |
|---|
| 32 | EE | Adrien Guignard,
Eric Sopena:
Compound Node-Kayles on paths.
Theor. Comput. Sci. 410(21-23): 2033-2044 (2009) |
| 2008 |
|---|
| 31 | EE | Adrien Guignard,
Eric Sopena:
Compound Node-Kayles on Paths
CoRR abs/0806.3033: (2008) |
| 30 | EE | Amanda Montejano,
Pascal Ochem,
Alexandre Pinlou,
André Raspaud,
Eric Sopena:
Homomorphisms of 2-edge-colored graphs.
Electronic Notes in Discrete Mathematics 30: 33-38 (2008) |
| 29 | EE | Pascal Ochem,
Alexandre Pinlou,
Eric Sopena:
On the oriented chromatic index of oriented graphs.
Journal of Graph Theory 57(4): 313-332 (2008) |
| 2006 |
|---|
| 28 | EE | Mohammad Hosseini Dolama,
Eric Sopena:
On the oriented chromatic number of graphs with given excess.
Discrete Mathematics 306(13): 1342-1350 (2006) |
| 27 | EE | Alexandre Pinlou,
Eric Sopena:
The acircuitic directed star arboricity of subcubic graphs is at most four.
Discrete Mathematics 306(24): 3281-3289 (2006) |
| 26 | EE | Alexandre Pinlou,
Eric Sopena:
Oriented vertex and arc colorings of outerplanar graphs.
Inf. Process. Lett. 100(3): 97-104 (2006) |
| 25 | EE | Mohammad Hosseini Dolama,
Eric Sopena:
On the oriented chromatic number of Halin graphs.
Inf. Process. Lett. 98(6): 247-252 (2006) |
| 2005 |
|---|
| 24 | EE | Mohammad Hosseini Dolama,
Eric Sopena:
On the maximum average degree and the incidence chromatic number of a graph.
Discrete Mathematics & Theoretical Computer Science 7(1): 203-216 (2005) |
| 2004 |
|---|
| 23 | EE | Mohammad Hosseini Dolama,
Eric Sopena,
Xuding Zhu:
Incidence coloring of k-degenerated graphs.
Discrete Mathematics 283(1-3): 121-128 (2004) |
| 2002 |
|---|
| 22 | EE | Eric Sopena:
There exist oriented planar graphs with oriented chromatic number at least sixteen.
Inf. Process. Lett. 81(6): 309-312 (2002) |
| 21 | EE | Dmitry Fon-Der-Flaass,
Alexandr V. Kostochka,
Jaroslav Nesetril,
André Raspaud,
Eric Sopena:
Nilpotent Families of Endomorphisms of (p(V)+, cup).
J. Comb. Theory, Ser. B 86(1): 100-108 (2002) |
| 2001 |
|---|
| 20 | EE | Cyril Gavoille,
David Peleg,
André Raspaud,
Eric Sopena:
Small k-Dominating Sets in Planar Graphs with Applications.
WG 2001: 201-216 |
| 19 | | Oleg V. Borodin,
Alexandr V. Kostochka,
André Raspaud,
Eric Sopena:
Acyclic colouring of 1-planar graphs.
Discrete Applied Mathematics 114(1-3): 29-41 (2001) |
| 18 | EE | Eric Sopena:
Oriented graph coloring.
Discrete Mathematics 229(1-3): 359-369 (2001) |
| 17 | EE | Pavol Hell,
Alexandr V. Kostochka,
André Raspaud,
Eric Sopena:
On nice graphs.
Discrete Mathematics 234(1-3): 39-51 (2001) |
| 16 | EE | Jaroslav Nesetril,
Eric Sopena:
On the Oriented Game Chromatic Number.
Electr. J. Comb. 8(2): (2001) |
| 15 | EE | Oleg V. Borodin,
Dmitry Fon-Der-Flaass,
Alexandr V. Kostochka,
André Raspaud,
Eric Sopena:
On Deeply Critical Oriented Graphs.
J. Comb. Theory, Ser. B 81(1): 150-155 (2001) |
| 1999 |
|---|
| 14 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Jaroslav Nesetril,
André Raspaud,
Eric Sopena:
On the maximum average degree and the oriented chromatic number of a graph.
Discrete Mathematics 206(1-3): 77-89 (1999) |
| 1998 |
|---|
| 13 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Jaroslav Nesetril,
André Raspaud,
Eric Sopena:
On universal graphs for planar oriented graphs of a given girth.
Discrete Mathematics 188(1-3): 73-85 (1998) |
| 1997 |
|---|
| 12 | | Yves Métivier,
Eric Sopena:
Graph Relabelling Systems: A General Overview.
Computers and Artificial Intelligence 16(2): (1997) |
| 11 | EE | Jarik Nesetril,
André Raspaud,
Eric Sopena:
Colorings and girth of oriented planar graphs.
Discrete Mathematics 165-166: 519-530 (1997) |
| 1996 |
|---|
| 10 | | Eric Sopena:
Expanding Graph Relabeling Systems have the Power of Recursive Enumerability.
Fundam. Inform. 27(1): 1-25 (1996) |
| 1995 |
|---|
| 9 | EE | Igor Litovsky,
Yves Métivier,
Eric Sopena:
Checking global graph properties by means of local computations: the majority problem.
Electr. Notes Theor. Comput. Sci. 2: (1995) |
| 8 | | Igor Litovsky,
Yves Métivier,
Eric Sopena:
Different Local Controls for Graph Relabeling Systems.
Mathematical Systems Theory 28(1): 41-65 (1995) |
| 1994 |
|---|
| 7 | | André Raspaud,
Eric Sopena:
Good and Semi-Strong Colorings of Oriented Planar Graphs.
Inf. Process. Lett. 51(4): 171-174 (1994) |
| 1993 |
|---|
| 6 | EE | Robert Cori,
Eric Sopena:
Some Combinatorial Aspects of Time-stamp Systems.
Eur. J. Comb. 14(2): 95-102 (1993) |
| 1992 |
|---|
| 5 | | Igor Litovsky,
Yves Métivier,
Eric Sopena:
Definitions and Comparisons of Local Computations on Graphs.
MFCS 1992: 364-373 |
| 1991 |
|---|
| 4 | | Eric Sopena:
Hypermap Rewriting: A Combinatorial Approach.
Theor. Comput. Sci. 85(2): 253-281 (1991) |
| 1989 |
|---|
| 3 | | Michel Billaud,
Pierre Lafon,
Yves Métivier,
Eric Sopena:
Graph Rewriting Systems with Priorities.
WG 1989: 94-106 |
| 1988 |
|---|
| 2 | | Robert Cori,
Eric Sopena,
Michel Latteux,
Yves Roos:
2-Asynchronous Automata.
Theor. Comput. Sci. 61: 93-102 (1988) |
| 1987 |
|---|
| 1 | | Eric Sopena:
Combinatorial Hypermap Rewriting.
RTA 1987: 62-73 |
