Graphs & Applications
Publications of Pascal OCHEM
(bibtex format)
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.
[
2004 |
2003]
2004
- Pascal Ochem. Oriented colorings of triangle-free planar graphs. Inf. Process. Lett., 92(2):71-76, 2004.
- Pascal Ochem. A generator of morphisms for infinite words. In Proceedings of the Workshop on Words avoidability, complexity and morphisms - Edited by G. Richomme, 2004.
- Lucian Ilie, Pascal Ochem, and Jeffrey Shallit. A generalization of repetition threshold. In MFCS, pages 818-826, 2004.
- József Balogh, Pascal Ochem, and András Pluhár. On the interval number of special graphs. J. Graph Theory., 46 (4):241-253, 2004.
2003
- Gregory Kucherov, Pascal Ochem, and Michaël Rao. How many square occurrences must a binary sequence contain?Electr. J. Comb., 10, 2003.
10 janvier 2008 (5)
[home page of the team]