| 2008 |
|---|
| 24 | EE | Jaroslav Nesetril,
Claude Tardif:
A dualistic approach to bounding the chromatic number of a graph.
Eur. J. Comb. 29(1): 254-260 (2008) |
| 23 | EE | Jan Foniok,
Jaroslav Nesetril,
Claude Tardif:
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures.
Eur. J. Comb. 29(4): 881-899 (2008) |
| 22 | EE | Cynthia Loten,
Claude Tardif:
Majority functions on structures with finite duality.
Eur. J. Comb. 29(4): 979-986 (2008) |
| 21 | EE | Zhongyuan Che,
Karen L. Collins,
Claude Tardif:
Odd-angulated graphs and cancelling factors in box products.
Journal of Graph Theory 58(3): 221-238 (2008) |
| 2007 |
|---|
| 20 | EE | Benoit Larose,
Cynthia Loten,
Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems
CoRR abs/0707.2562: (2007) |
| 19 | EE | Jan Foniok,
Jaroslav Nesetril,
Claude Tardif:
On Finite Maximal Antichains in the Homomorphism Order.
Electronic Notes in Discrete Mathematics 29: 389-396 (2007) |
| 18 | EE | Benoit Larose,
Cynthia Loten,
Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems.
Logical Methods in Computer Science 3(4): (2007) |
| 2006 |
|---|
| 17 | EE | Benoit Larose,
Cynthia Loten,
Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems.
LICS 2006: 201-210 |
| 16 | EE | Jan Foniok,
Jaroslav Nesetril,
Claude Tardif:
Generalised Dualities and Finite Maximal Antichains.
WG 2006: 27-36 |
| 15 | EE | Anthony Bonato,
Claude Tardif:
Mutually embeddable graphs and the tree alternative conjecture.
J. Comb. Theory, Ser. B 96(6): 874-880 (2006) |
| 14 | EE | Claude Tardif,
David L. Wehlau:
Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function.
Journal of Graph Theory 51(1): 33-36 (2006) |
| 13 | EE | Reza Naserasr,
Claude Tardif:
The chromatic covering number of a graph.
Journal of Graph Theory 51(3): 199-204 (2006) |
| 2005 |
|---|
| 12 | EE | Claude Tardif:
The Fractional Chromatic Number Of The Categorical Product Of Graphs.
Combinatorica 25(5): 625-632 (2005) |
| 11 | EE | Claude Tardif:
Multiplicative graphs and semi-lattice endomorphisms in the category of graphs.
J. Comb. Theory, Ser. B 95(2): 338-345 (2005) |
| 10 | EE | Jaroslav Nesetril,
Claude Tardif:
Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality.
SIAM J. Discrete Math. 19(4): 914-920 (2005) |
| 2002 |
|---|
| 9 | EE | Claude Tardif,
Xuding Zhu:
The level of nonmultiplicativity of graphs.
Discrete Mathematics 244(1-3): 461-471 (2002) |
| 8 | EE | Claude Tardif,
Xuding Zhu:
On Hedetniemi's conjecture and the colour template scheme.
Discrete Mathematics 253(1-3): 77-85 (2002) |
| 7 | | Jaroslav Nesetril,
Claude Tardif:
Density via duality.
Theor. Comput. Sci. 287(2): 585-591 (2002) |
| 2000 |
|---|
| 6 | EE | Benoit Larose,
Claude Tardif:
Hedetniemi's Conjecture and the Retracts of a Product of Graphs.
Combinatorica 20(4): 531-544 (2000) |
| 5 | EE | Jaroslav Nesetril,
Claude Tardif:
Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations).
J. Comb. Theory, Ser. B 80(1): 80-97 (2000) |
| 1998 |
|---|
| 4 | EE | Claude Tardif:
Graph products and the chromatic difference sequence of vertex-transitive graphs.
Discrete Mathematics 185(1-3): 193-200 (1998) |
| 3 | EE | Benoit Larose,
François Laviolette,
Claude Tardif:
On Normal Cayley Graphs and Hom-idempotent Graphs.
Eur. J. Comb. 19(7): 867-881 (1998) |
| 1997 |
|---|
| 2 | EE | Claude Tardif:
A fixed box theorem for the cartesian product of graphs and metric spaces.
Discrete Mathematics 171(1-3): 237-248 (1997) |
| 1992 |
|---|
| 1 | EE | Claude Tardif:
Prefibers and the cartesian product of metric spaces.
Discrete Mathematics 109(1-3): 283-288 (1992) |
