SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Eric Sopena: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.003secs, Finished in 0.306secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP