The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Henri Thuillier: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-Luc Fouquet, Florian Roussel, P. Rubio, Henri Thuillier
    New classes of perfectly orderable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:95-109 [Journal]
  2. Vassilis Giakoumakis, Florian Roussel, Henri Thuillier
    On P4-tidy graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 1997, v:1, n:1, pp:17-41 [Journal]
  3. Florian Roussel, Irena Rusu, Henri Thuillier
    On Graphs with Limited Number of P4-Partners. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:1, pp:103-0 [Journal]
  4. Jean-Luc Fouquet, Igor Parfenoff, Henri Thuillier
    An O(n) Time Algorithm for Maximum Matching in P4-Tidy Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:6, pp:281-287 [Journal]
  5. Jean-Luc Fouquet, Henri Thuillier
    On some conjectures on cubic 3-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:1, pp:41-57 [Journal]
  6. Vassilis Giakoumakis, Florian Roussel, Henri Thuillier
    Scattering number and modular decomposition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:321-342 [Journal]
  7. Jean-Luc Fouquet, Frédéric Maire, Irena Rusu, Henri Thuillier
    On transversals in minimal imperfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:301-312 [Journal]
  8. Jean-Luc Fouquet, Henri Thuillier
    Decomposition of 3-connected cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:181-198 [Journal]
  9. Jean-Luc Fouquet, Vassilis Giakoumakis, Frédéric Maire, Henri Thuillier
    On graphs without P5 and P5_. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:146, n:1-3, pp:33-44 [Journal]

  10. On a family of cubic graphs containing the flower snarks [Citation Graph (, )][DBLP]


  11. On isomorphic linear partitions in cubic graphs. [Citation Graph (, )][DBLP]


  12. The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002