List of publications

Last update on December 25th, 2008.

Coloring the square of the Cartesian product of two cycles, preprint (2009). (with J. Wu)
pdf – 127K

Chromatic number of sparse colored mixed graphs, Eurocomb’09, accepted. (with A. Montejano, A. Pinlou and A. Raspaud)
pdf – 50K

Compound Node-Kayles on paths, Theoret. Comput. Sci. 410 (21-23), 2033-2044, 2009. (with A. Guignard)
doi:10.1016/j.tcs.2008.12.053, pdf – 168K

Homomorphisms of 2-edge-colored graphs, long version, 2008, submitted. (with A. Montejano, P. Ochem, A. Pinlou and A. Raspaud)
pdf – 169K

Homomorphisms of 2-edge-colored graphs, IV Latin-American Algorithms, Graphs and Optimization Symposium LAGOS’2007, Electronic Notes in Discrete Math. 30, 33-38, 2008. (with A. Montejano, P. Ochem, A. Pinlou and A. Raspaud)
doi:10.1016/j.endm.2008.01.007 

On the oriented chromatic index of oriented graphs, J. Graph Theory 57 (4), 313-332, 2008. (with P. Ochem and A. Pinlou).
doi:10.1002/jgt.20286, Postscript – 353K.

Oriented vertex and arc colorings of outerplanar graphs, Inform. Proc. Letters 100 (3), 97-104, 2006. (with A. Pinlou).
doi:10.1016/j.ipl.2006.06.012, MR2254199 (2007e:05052), Postscript - 639K

On the oriented chromatic number of Halin graphs, Inform. Proc. Letters 98 (6), 247-252, 2006. (with M. Hosseini Dolama).
doi:10.1016/j.ipl.2005.03.016, MR2221538 (2006k:05086), Postscript – 318K

On the maximum average degree and the incidence chromatic number of a graph, Discrete Math. and Theoret. Comput. Sci. 7 (1), 203-216, 2005. (with M. Hosseini Dolama).
MR2164065 (2007b:05071), Postscript – 285K

Acircuitic directed star arboricity of planar graphs with large girth, preprint, 2005. (with A. Pinlou).
pdf - 228K

On the oriented chromatic number of graphs with given excess, Discrete Math. 306 (13), 1342-1350, 2006. (with M. Hosseini Dolama).
doi:10.1016/j.disc.2005.12.023, MR2237718 (2007d:05059), Postscript – 308K

The acircuitic directed star arboricity of subcubic graphs is at most four, Discrete Math. 306 (24), 3281-3289, 2006. (with A. Pinlou).
doi:10.1016/j.disc.2006.06.007, MR2279062 (2007i:05101), pdf – 127K

Incidence coloring of k-degenerated graphs, Discrete Math. 283 (1-3), 121-128, 2004. (with M. Hosseini Dolama and X. Zhu).
doi:10.1016/j.disc.2004.01.015, MR2061489 (2004m:05105), Postscript - 245K

There exist oriented planar graphs with oriented chromatic number at least sixteen, Inform. Proc. Letters 81 (6), 309-312, 2002.
doi:10.1016/S0020-0190(01)00246-0, MR1879796 (2002k:05090), Postscript - 137K

Acyclic list 7-colouring of planar graphs, J. Graph Theory 40 (2), 83-90, 2002. (with O. Borodin, D. Fon-der-Flaass, A. Kostochka and A. Raspaud). 
MR1899114 (2003h:05079), Postscript - 194K

Nilpotent families of endomorphisms of (P(V)+,U), J. Combin. Theory, Ser. B. 86 (1), 100-108, 2002. (with D. Fon-der-Flaass, A. Kostochka, J. Nesetril and A. Raspaud).  
doi:10.1006/jctb.2002.2116
, MR1930125 (2003g:05063), Postscript - 163K

Small k-dominating sets in planar graphs with applications, proceedings of WG’01, LNCS 2204, 2001. (with C. Gavoille, D. Peleg and A. Raspaud).  
Postscript - 308K

On deeply critical oriented graphs, J. Combin. Theory, Ser. B. 81, 150-155, 2001. (with O. Borodin, D. Fon-der-Flaass, A. Kostochka and A. Raspaud).  
doi:10.1006/jctb.2000.1984
, MR1809432 (2001j:05059), Postscript - 134K

Two problems on planar graphs, Proc. 5th Graph Theory Day, Prague, March 2001.  
Postscript - 114K

Oriented graph coloring, Discrete Math. 229 (1-3), 359-369, 2001. 
doi:10.1016/S0012-365X(00)00216-8
, MR1815613 (2002g:05088), Postscript - 197K

On nice graphs, Discrete Math., 234, 39-51, 2001. (with P. Hell, A.V. Kostochka and A. Raspaud).  
doi:10.1016/S0012-365X(00)00190-4
, MR1826818 (2002h:05064), Postscript - 215K

On the oriented game chromatic number, Electronic J. of Combin. 8 (2), paper #R14, special volume in the honour of Aviezri Fraenkel, 2001. (with J. Nesetril). 
MR1853265 (2002h:05069), Postscript - 197K

Three-and-more set theorems, Comment. Math. Univ. Carolinae, 41 (4), 793-801, 2000. (with P. Hell, J. Nesetril and A. Raspaud). 
MR1800165 (2001k:05198), Postscript - 178K

Acyclic k-strong coloring of maps on surfaces, (Russian) Mat. Zametki 67 (1), 36-45 (2000), translation in Math. Notes 67 (1-2), 29-35, 2000. (with O. Borodin, A. Kostochka and A. Raspaud).  
doi:10.1007/BF02675788
, MR1763544 (2001d:05055), Postscript - 182K

On the maximum average degree and the oriented chromatic number of a graph, Discrete Math. 206, 77-89, 1999. (with O.V. Borodin, A.V. Kostochka, J. Nesetril and A. Raspaud).  
doi:10.1016/S0012-365X(98)00393-8, MR1665387 (2000h:05076), Postscript - 251K

On four coloring problems, DIMATIA Series 99:418, 1999. Written for the Spring School in Combinatorics, Prague, Czech Rep., April 1999 (with J. Nesetril). 
Postscript - 633K

Acyclic improper colorings of graphs, J. Graph Theory, 32, 97-107, 1999. (with P. Boiron and L. Vignal). 
MR1704140 (2000g:05061), Postscript - 218K

Acyclic colouring of 1-planar graphs, Discrete Analysis and Operations Research 6, n° 4, 20-35, 1999. (with O. Borodin, A. Kostochka and A. Raspaud).  
Postscript - 207K

Graph relabelling systems and distributed algorithms, Handbook of graph grammars and computing by graph transformation, vol. III, World Scientific, H. Ehrig, H.-J. Kreowski, U. Montanari and G. Rozenberg eds., 1-56, 1999. (with I. Litovsky and Y. Métivier).  
Postscript - 596K

On universal graphs for planar oriented graphs of a given girth, Discrete Math. 188, 73-85, 1998. (with O.V. Borodin, A.V. Kostochka, J. Nesetril and A. Raspaud).  
MR1630446 (99e:05046), Postscript - 218K

The chromatic number of oriented graphs, J. Graph Theory 25, 191-205, 1997.  
MR1451297 (98c:05069), Postscript - 264K

Acyclic and oriented chromatic numbers of graphs, J. Graph Theory 24 (4), 331-340, 1997. (with A.V. Kostochka and X. Zhu).  
MR1437294 (98e:05051), Postscript - 207K

Graph relabeling systems: a general overview, Computers and Artificial Intelligence 16 (2), 167-185, 1997. (with Y. Métivier).  
MR1463000 (98h:68076), Postscript - 229K

On the minimum number of edges giving maximum oriented chromatic number, Proc. of the Dimacs/Dimatia conference « Contemporary Trends in Discrete Mathematics », Stirin, Czech Rep., May 1997, Dimacs Series in Discrete Mathematics and Theoretical Computer Science 49, 179-182. (with A.V. Kostochka, T. Luczak and G. Simonyi). 
Postscript - 135K

Acyclic improper colourings of graphs with bounded degree, Proc. of the Dimacs/Dimatia conference « Contemporary Trends in Discrete Mathematics », Stirin, Czech Rep., May 1997, Dimacs Series in Discrete Mathematics and Theoretical Computer Science 49, 1-10. (with P. Boiron and L. Vignal). 
Postscript - 232K

Colorings and girth of oriented planar graphs, Discrete Math. 165/166, 519-530, 1997. (with J. Nesetril and A. Raspaud).  
MR1439297 (97k:05083), Postscript - 251K

T-preserving homomorphisms of oriented graphs, Comment. Math. Univ. Carolinae 38 (1), 125-136, 1997. (with J. Nesetril and L. Vignal). 
MR1455476 (98h:05085), Postscript - 201K

Checking global graph properties by means of local computations : the majority problem, Electronic Notes in Comput. Sci. 2, 1996. (with I. Litovsky and Y. Métivier).  
Postscript - 185K

A note on the oriented chromatic number of graphs with maximum degree three, Research report, LaBRI, 1996. (with L. Vignal). 
Postscript - 104K

Expanding graph relabeling systems have the power of recursive enumerability, Fundamenta Informaticae 27 (1), 1-26, 1996.  
Postscript - 296K

Different local controls for graph relabeling systems, Math. System Theory 28, 41-65, 1995. (with I. Litovsky and Y. Métivier). 
MR1296800 (95m:68130), Postscript - 311K

Combinatorial construction of time-stamp systems and interpolation systems, Proc. Formal Power Series and Algebraic Combinatorics FPSAC'95, Marne-La-Vallée, 1995. (with V. Albiero).  
Postscript - 203K

Computing Chromatic polynomials of Oriented Graphs, Proc. Formal Power Series and Algebraic Combinatorics FPSAC'94, Dimacs, 413-422, 1994. 
Postscript - 241K

Good and Semi-strong Colorings of Oriented Planar Graphs, Inform. Processing Letters 51, 171-174, 1994. (with A. Raspaud).  
MR1294309 (95i:05060), Postscript - 139K

Some combinatorial aspects of time-stamps systems, Europ. J. Combin. 14, 95-102, 1993. (with R. Cori).  
MR1206614 (93k:05085), Postscript - 161K

Definition and comparison of local computations on graphs, Proc. Mathematical Foundations of Computer Science MFCS'92, Lecture Notes in Comput. Sci. 629, 364-373, 1992. (with I. Litovsky and Y. Métivier). 

Hypermap Rewriting: A Combinatorial Approach, Theoret. Comput. Sci. 85, 253-281, 1991. 

Graph rewriting systems with priorities, Proc. 15th Int. Workshop on Graph-theoretic Concepts in Computer Science WG'89, Lecture Notes in Comput. Sci. 411, 94-106, 1989. (with M. Billaud, P. Lafon and Y. Métivier).  

2-asynchronous automata, Theoret. Comput. Sci. 61, 93-102, 1988. (with R. Cori, M. Latteux, and Y. Roos).  

Combinatorial hypermap rewriting, Proc. RTA'87, Lecture Notes in Comput. Sci. 256, 62-73, 1987.