Graphs & Applications
Publications of Eric SOPENA

(bibtex format)
[publications of the team]

Copyrights for some of the papers below have been transfered, or will be transfered to various publishers of journals, conferences proceedings, etc. For such papers I am required to post the following notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. Publisher's copyright policy are available at © SIAM, © ACM, © IEEE, © Springer, © Elsevier, © Ideal, © King's College.


[ 2005 | 2004 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995]


2005

  1. M. Hosseini Dolama and E. Sopena. On the oriented chromatic number of halin graphs. Inform. Proc. Letters, 2005. to appear.



2004

  1. M. Hosseini Dolama, E. Sopena, and X. Zhu. Incidence coloring of k-degenerated graphs. Discrete Math., 283:121-128, 2004.



2002

  1. D. Fon-Der-Flaass, A.V. Kostochka, A. Raspaud, and E. Sopena. Nilpotent families of endomorphisms of (p(v)^+,\cup). J. Combin. Theory, Ser. B, 86(1):100-108, 2002. (Compressed postcript).

  2. O.V. Borodin, D. Fon-Der-Flaass, A.V. Kostochka, A. Raspaud, and E. Sopena. Acyclic list 7-colouring of planar graphs. J. Graph Theory, 40(2):83-90, 2002. (Compressed postcript).

  3. E. Sopena. There exist oriented planar graphs with oriented chromatic number at least sixteen. Inform. Proc. Letters, 81(6):309-312, 2002. (Compressed postcript).



2001

  1. O.V. Borodin, D. Fon-Der-Flaass, A.V. Kostochka, A. Raspaud, and E. Sopena. On deeply critical oriented graphs. J. Combin. Theory, Ser. B, 81:150-155, 2001. (Compressed postcript).

  2. E. Sopena. Two problems on planar graphs. In Proc. 5th Graph Theory Day, 2001. (Compressed postcript).

  3. E. Sopena. Oriented graph coloring. Discrete Math., 229(1-3):359-369, 2001. (Compressed postcript).

  4. J. Nesetril and E. Sopena. On the oriented game chromatic number. Electronic J. of Combin., 8(2), 2001. Paper 14, (Compressed postcript).

  5. P. Hell, A.V. Kostochka, A. Raspaud, and E. Sopena. On nice graphs. Discrete Math., 234:39-51, 2001. (Compressed postcript).

  6. C. Gavoile, D. Peleg, A. Raspaud, and E. Sopena. Small k-dominating sets in planar graphs with applications. In Proc. Workshop on Graphs, WG'01, LNCS 2204, pages 201-216, 2001. (Compressed postcript).



2000

  1. O.V. Borodin, A.V. Kostochka, A. Raspaud, and E. Sopena. Acyclic k-strong hypergraph coloring of maps on surfaces. Mathematical Note, 67(1-2):29-35, 2000. (Compressed postcript).

  2. P. Hell, J. Nesetril, A. Raspaud, and E. Sopena. Three-and-more set theorems. Comment. Math. Univ. Carolinae, 41(4):7793-801, 2000. (Compressed postcript).



1999

  1. O.V. Borodin, A.V. Kostochka, A. Raspaud, and E. Sopena. Acyclic colouring of 1-planar graphs. Discrete Analysis and Operations Research, 6(4):20-35, 1999. (Compressed postcript).

  2. O.V. Borodin, A.V. Kostochka, J. Nesetril, A. Raspaud, and E. Sopena. On the maximum average degree and the oriented chromatic number of a graph. Discrete Math., 206:77-89, 1999. (Compressed postcript).

  3. J. Nesetril and E. Sopena. On four coloring problems. Technical report, LaBRI, Université Bordeaux 1, 1999. (Compressed postcript).

  4. P. Boiron, E. Sopena, and L. Vignal. Acyclic improper colourings of graphs. J. Graph Theory, 32:97-107, 1999. (Compressed postcript).

  5. I. Litovsky, Y.Métivier, and E. Sopena. Graph relabelling systems and distributed algorithms. In H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors, Handbook of graph grammars and computing by graph transformation, volume 3, pages 1-56. World Scientific, 1999. (Compressed postcript).



1998

  1. O.V. Borodin, A.V. Kostochka, J. Nesetril, A. Raspaud, and E. Sopena. On universal graphs for planar oriented graphs of a given girth. Discrete Math., 188:73-85, 1998. (Compressed postcript).



1997

  1. E. Sopena. The chromatic number of oriented graphs. J. Graph Theory, 25:191-205, 1997. (Compressed postcript).

  2. J. Nesetril, E. Sopena, and L. Vignal. T-preserving homomorphisms of oriented graphs. Comment. Math. Univ. Carolinae, 38-1:125-136, 1997. (Compressed postcript).

  3. J. Nesetril, A. Raspaud, and E. Sopena. Colorings and girth of oriented planar graphs. Discrete Math., 165-166:519-530, 1997. (Compressed postcript).

  4. Y. Métivier and E. Sopena. Graph relabelling systems: a general overview. Computers and Artificial Intelligence, 16(2):167-185, 1997. (Compressed postcript).

  5. A.V. Kostochka, E. Sopena, and X. Zhu. Acyclic and oriented chromatic numbers. J. Graph Theory, 24(4):331-340, 1997. (Compressed postcript).

  6. A. V. Kostochka, T. Luczak, G. Simonyi, and E. Sopena. On the minimum number of edges giving maximum oriented chromatic number. In Proc. DIMACS/DIMATIA Conf. Contemporary trends in Discrete Math., Dimacs Series in Discrete Math. and Theoret. Comput. Sci., volume 49, pages 179-182, 1997. (Compressed postcript).

  7. P. Boiron, E. Sopena, and L. Vignal. Acyclic improper colourings of graphs with bounded degree. In Proc. DIMACS/DIMATIA Conf. Contemporary trends in Discrete Math., Dimacs Series in Discrete Math. and Theoret. Comput.Sci., volume 49, pages 1-10, 1997. (Compressed postcript).



1996

  1. E. Sopena and L. Vignal. A note on the chromatic number of graphs with maximum degree three. Technical Report 1125-96, LaBRI, Université Bordeaux 1, 1996. (Compressed postcript).

  2. E. Sopena. Expanding graph relabeling systems have the power of recursive enumerability. Fundamentae Informatica, 27(1):1-26, 1996. (Compressed postcript).

  3. I. Litovsky, Y.Métivier, and E. Sopena. Checking global graph properties by means of local computations: the majority problem. Electronic Notes in Comput. Sci., 2, 1996. (Compressed postcript).



1995

  1. I. Litovsky, Y.Métivier, and E. Sopena. Different local controls for graph relabeling systems. Math. Systems Theory, 28:41-65, 1995. (Compressed postcript).

  2. V. Albiero and E. Sopena. Combinatorial construction of time-stamp systems. In Proc. Formal Power Series and Algebraic Combinatorics, FPSAC'95, 1995. (Compressed postcript).



10 janvier 2008 (31)
[home page of the team]