Prefibers and the cartesian product of metric spaces. - Claude Tardif (Discret. Math., 1992)

On compact median graphs. - Claude Tardif (J. Graph Theory, 1996)

Density. - Jaroslav Nesetril; Claude Tardif (Contemporary Trends in Discrete Mathematics, 1997)

A fixed box theorem for the cartesian product of graphs and metric spaces. - Claude Tardif (Discret. Math., 1997)

Graph products and the chromatic difference sequence of vertex-transitive graphs. - Claude Tardif (Discret. Math., 1998)

On Normal Cayley Graphs and Hom-idempotent Graphs. - Benoît Larose; François Laviolette; Claude Tardif (Eur. J. Comb., 1998)

Hedetniemi's Conjecture and the Retracts of a Product of Graphs. - Benoît Larose; Claude Tardif (Comb., 2000)

Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations). - Jaroslav Nesetril; Claude Tardif (J. Comb. Theory B, 2000)

Chromatic Numbers of Products of Tournaments: FractionalAspects of Hedetniemi's Conjecture. - Claude Tardif (Graphs, Morphisms and Statistical Physics, 2001)

Fractional chromatic numbers of cones over graphs. - Claude Tardif (J. Graph Theory, 2001)

On Hedetniemi's conjecture and the colour template scheme. - Claude Tardif; Xuding Zhu (Discret. Math., 2002)

The level of nonmultiplicativity of graphs. - Claude Tardif; Xuding Zhu (Discret. Math., 2002)

Projectivity and independent sets in powers of graphs. - Benoît Larose; Claude Tardif (J. Graph Theory, 2002)

Density via duality. - Jaroslav Nesetril; Claude Tardif (Theor. Comput. Sci., 2002)

On maximal finite antichains in the homomorphism order of directed graphs. - Jaroslav Nesetril; Claude Tardif (Discuss. Math. Graph Theory, 2003)

Large families of mutually embeddable vertex-transitive graphs. - Anthony Bonato; Claude Tardif (J. Graph Theory, 2003)

A clone-theoretic formulation of the Erdös-Faber-Lovász conjecture. - Lucien Haddad; Claude Tardif (Discuss. Math. Graph Theory, 2004)

The Fractional Chromatic Number Of The Categorical Product Of Graphs. - Claude Tardif (Comb., 2005)

Multiplicative graphs and semi-lattice endomorphisms in the category of graphs. - Claude Tardif (J. Comb. Theory B, 2005)

Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality. - Jaroslav Nesetril; Claude Tardif (SIAM J. Discret. Math., 2005)

Generalised Dualities and Finite Maximal Antichains. - Jan Foniok; Jaroslav Nesetril; Claude Tardif (WG, 2006)

Mutually embeddable graphs and the tree alternative conjecture. - Anthony Bonato; Claude Tardif (J. Comb. Theory B, 2006)

The chromatic covering number of a graph. - Reza Naserasr; Claude Tardif (J. Graph Theory, 2006)

Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function. - Claude Tardif; David L. Wehlau (J. Graph Theory, 2006)

On Finite Maximal Antichains in the Homomorphism Order. - Jan Foniok; Jaroslav Nesetril; Claude Tardif (Electron. Notes Discret. Math., 2007)

A Characterisation of First-Order Constraint Satisfaction Problems. - Benoît Larose; Cynthia Loten; Claude Tardif (Log. Methods Comput. Sci., 2007)

Generalised dualities and maximal finite antichains in the homomorphism order of relational structures. - Jan Foniok; Jaroslav Nesetril; Claude Tardif (Eur. J. Comb., 2008)

Majority functions on structures with finite duality. - Cynthia Loten; Claude Tardif (Eur. J. Comb., 2008)

A dualistic approach to bounding the chromatic number of a graph. - Jaroslav Nesetril; Claude Tardif (Eur. J. Comb., 2008)

Odd-angulated graphs and cancelling factors in box products. - Zhongyuan Che; Karen L. Collins; Claude Tardif (J. Graph Theory, 2008)

Adjoint functors and tree duality. - Jan Foniok; Claude Tardif (Discret. Math. Theor. Comput. Sci., 2009)

Homomorphisms of random paths. - Gábor Kun; Claude Tardif (Eur. J. Comb., 2010)

Large classes of infinite k-cop-win graphs. - Anthony Bonato; Gena Hahn; Claude Tardif (J. Graph Theory, 2010)

Path homomorphisms, graph colorings, and boolean matrices. - Jaroslav Nesetril; Claude Tardif (J. Graph Theory, 2010)

Dualities and Dual Pairs in Heyting Algebras. - Jan Foniok; Jaroslav Nesetril; Ales Pultr; Claude Tardif (Order, 2010)

Interleaved adjoints of directed graphs. - Jan Foniok; Jaroslav Nesetril; Claude Tardif (Eur. J. Comb., 2011)

Hedetniemi's Conjecture and Dense Boolean Lattices. - Claude Tardif (Order, 2011)

Near-Unanimity Polymorphisms on Structures with Finite Duality. - Cynthia Loten; Claude Tardif (SIAM J. Discret. Math., 2011)

On infinite-finite tree-duality pairs of relational structures - Péter L. Erdös; Dömötör Pálvölgyi; Claude Tardif; Gábor Tardos (CoRR, 2012)

The chromatic Ramsey number of odd wheels. - Nathalie Paul; Claude Tardif (J. Graph Theory, 2012)

Colourful Theorems and Indices of Homomorphism Complexes. - Gábor Simonyi; Claude Tardif; Ambrus Zsbán (Electron. J. Comb., 2013)

Adjoint functors in graph theory - Jan Foniok; Claude Tardif (CoRR, 2013)

On Infinite-finite Duality Pairs of Directed Graphs. - Péter L. Erdös; Claude Tardif; Gábor Tardos (Order, 2013)

Caterpillar Dualities and Regular Languages. - Péter L. Erdös; Claude Tardif; Gábor Tardos (SIAM J. Discret. Math., 2013)

Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. - Tomás Feder; Pavol Hell; Benoît Larose; Cynthia Loten; Mark H. Siggers; Claude Tardif (SIAM J. Discret. Math., 2013)

Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. - Tomás Feder; Pavol Hell; Benoît Larose; Mark H. Siggers; Claude Tardif (SIAM J. Discret. Math., 2014)

Homomorphisms of binary Cayley graphs. - Laurent Beaudou; Reza Naserasr; Claude Tardif (Discret. Math., 2015)

Digraph functors which admit both left and right adjoints. - Jan Foniok; Claude Tardif (Discret. Math., 2015)

Fractional aspects of the Erdös-Faber-Lovász Conjecture. - John Bosica; Claude Tardif (Discuss. Math. Graph Theory, 2015)

Regular families of forests, antichains and duality pairs of relational structures. - Péter L. Erdös; Dömötör Pálvölgyi; Claude Tardif; Gábor Tardos (Comb., 2017)

Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers. - Gord Simons; Claude Tardif; David L. Wehlau (J. Comb. Theory B, 2017)

Logical compactness and constraint satisfaction problems. - Danny Rorabaugh; Claude Tardif; David L. Wehlau (Log. Methods Comput. Sci., 2017)

Hedetniemi's Conjecture and Adjoint Functors in Thin Categories. - Jan Foniok; Claude Tardif (Appl. Categorical Struct., 2018)

A Note on Hedetniemi's Conjecture, Stahl's Conjecture and the Poljak-Rödl Function. - Claude Tardif; Xuding Zhu (Electron. J. Comb., 2019)

Hedetniemi's Conjecture and Strongly Multiplicative Graphs. - Claude Tardif; Marcin Wrochna (SIAM J. Discret. Math., 2019)

Topologically 4-chromatic graphs and signatures of odd cycles. - Gord Simons; Claude Tardif; David L. Wehlau (J. Graph Theory, 2020)

Narra. Un art visuel cognitif, au rythme de la longueur des paragraphes de textes littéraires. (Narra. A cognitive visual art, to the rhythm of paragraph length of literary texts). - Claude Tardif (2020)

The Chromatic Number of the Product of 14-Chromatic Graphs Can BE 13. - Claude Tardif (Comb., 2022)

Counterexamples to Hedetniemi's Conjecture with Large Fractional Chromatic Numbers. - Claude Tardif (Graphs Comb., 2022)

The Chromatic Number of the Product of 5-Chromatic Graphs can be 4. - Claude Tardif (Comb., 2023)

Chromatic Ramsey numbers of generalised Mycielski graphs. - Claude Tardif (Discuss. Math. Graph Theory, 2024)

Mutual embeddability in groups, trees, and spheres. - Claude Tardif (J. Comb. Theory B, 2024)