The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Claude Tardif: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Benoit Larose, Cynthia Loten, Claude Tardif
    A Characterisation of First-Order Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:201-210 [Conf]
  2. Jan Foniok, Jaroslav Nesetril, Claude Tardif
    Generalised Dualities and Finite Maximal Antichains. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:27-36 [Conf]
  3. Benoit Larose, Claude Tardif
    Hedetniemi's Conjecture and the Retracts of a Product of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:4, pp:531-544 [Journal]
  4. Claude Tardif
    The Fractional Chromatic Number Of The Categorical Product Of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:5, pp:625-632 [Journal]
  5. Claude Tardif, Xuding Zhu
    On Hedetniemi's conjecture and the colour template scheme. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:253, n:1-3, pp:77-85 [Journal]
  6. Claude Tardif, Xuding Zhu
    The level of nonmultiplicativity of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:461-471 [Journal]
  7. Benoit Larose, François Laviolette, Claude Tardif
    On Normal Cayley Graphs and Hom-idempotent Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:7, pp:867-881 [Journal]
  8. Jaroslav Nesetril, Claude Tardif
    Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:1, pp:80-97 [Journal]
  9. Claude Tardif
    Multiplicative graphs and semi-lattice endomorphisms in the category of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:95, n:2, pp:338-345 [Journal]
  10. Anthony Bonato, Claude Tardif
    Mutually embeddable graphs and the tree alternative conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:874-880 [Journal]
  11. Jaroslav Nesetril, Claude Tardif
    Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:914-920 [Journal]
  12. Jaroslav Nesetril, Claude Tardif
    Density via duality. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:585-591 [Journal]
  13. Reza Naserasr, Claude Tardif
    The chromatic covering number of a graph. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:51, n:3, pp:199-204 [Journal]
  14. Claude Tardif, David L. Wehlau
    Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:51, n:1, pp:33-36 [Journal]
  15. Benoit Larose, Cynthia Loten, Claude Tardif
    A Characterisation of First-Order Constraint Satisfaction Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  16. Claude Tardif
    Graph products and the chromatic difference sequence of vertex-transitive graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:185, n:1-3, pp:193-200 [Journal]
  17. Claude Tardif
    A fixed box theorem for the cartesian product of graphs and metric spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:237-248 [Journal]
  18. Claude Tardif
    Prefibers and the cartesian product of metric spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:109, n:1-3, pp:283-288 [Journal]

  19. A dualistic approach to bounding the chromatic number of a graph. [Citation Graph (, )][DBLP]


  20. Generalised dualities and maximal finite antichains in the homomorphism order of relational structures. [Citation Graph (, )][DBLP]


  21. Majority functions on structures with finite duality. [Citation Graph (, )][DBLP]


  22. Homomorphisms of random paths. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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