Claude Tardif

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 15

Top Topics

Relational Structures

Pseudo Boolean Optimization

Constraint Satisfaction Problems

Top Venues

SIAM J. Discret. Math.

Discuss. Math. Graph Theory

Publications

Claude Tardif
Chromatic Ramsey numbers of generalised Mycielski graphs. Discuss. Math. Graph Theory 44 (4) (2024)
Claude Tardif
Mutual embeddability in groups, trees, and spheres. J. Comb. Theory B 168 (2024)
Claude Tardif
The Chromatic Number of the Product of 5-Chromatic Graphs can be 4. Comb. 43 (6) (2023)
Claude Tardif
The Chromatic Number of the Product of 14-Chromatic Graphs Can BE 13. Comb. 42 (2) (2022)
Claude Tardif
Counterexamples to Hedetniemi's Conjecture with Large Fractional Chromatic Numbers. Graphs Comb. 38 (6) (2022)
Gord Simons, Claude Tardif, David L. Wehlau
Topologically 4-chromatic graphs and signatures of odd cycles. J. Graph Theory 95 (2) (2020)
Claude Tardif, Marcin Wrochna
Hedetniemi's Conjecture and Strongly Multiplicative Graphs. SIAM J. Discret. Math. 33 (4) (2019)
Claude Tardif, Xuding Zhu
A Note on Hedetniemi's Conjecture, Stahl's Conjecture and the Poljak-Rödl Function. Electron. J. Comb. 26 (4) (2019)
Jan Foniok, Claude Tardif
Hedetniemi's Conjecture and Adjoint Functors in Thin Categories. Appl. Categorical Struct. 26 (1) (2018)
Danny Rorabaugh, Claude Tardif, David L. Wehlau
Logical compactness and constraint satisfaction problems. Log. Methods Comput. Sci. 13 (1) (2017)
Gord Simons, Claude Tardif, David L. Wehlau
Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers. J. Comb. Theory, Ser. B 122 (2017)
Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos
Regular families of forests, antichains and duality pairs of relational structures. Comb. 37 (4) (2017)
Jan Foniok, Claude Tardif
Digraph functors which admit both left and right adjoints. Discret. Math. 338 (4) (2015)
Laurent Beaudou, Reza Naserasr, Claude Tardif
Homomorphisms of binary Cayley graphs. Discret. Math. 338 (12) (2015)
John Bosica, Claude Tardif
Fractional aspects of the Erdös-Faber-Lovász Conjecture. Discuss. Math. Graph Theory 35 (1) (2015)
Tomás Feder, Pavol Hell, Benoît Larose, Mark H. Siggers, Claude Tardif
Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. SIAM J. Discret. Math. 28 (2) (2014)
Jan Foniok, Claude Tardif
Digraph functors which admit both left and right adjoints CoRR (2013)
Gábor Simonyi, Claude Tardif, Ambrus Zsbán
Colourful Theorems and Indices of Homomorphism Complexes. Electron. J. Comb. 20 (1) (2013)
Péter L. Erdös, Claude Tardif, Gábor Tardos
On Infinite-finite Duality Pairs of Directed Graphs. Order 30 (3) (2013)
Jan Foniok, Claude Tardif
Adjoint functors in graph theory CoRR (2013)
Péter L. Erdös, Claude Tardif, Gábor Tardos
Caterpillar Dualities and Regular Languages. SIAM J. Discret. Math. 27 (3) (2013)
Tomás Feder, Pavol Hell, Benoît Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. SIAM J. Discret. Math. 27 (4) (2013)
Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos
On infinite-finite tree-duality pairs of relational structures CoRR (2012)
Péter L. Erdös, Claude Tardif, Gábor Tardos
On infinite-finite duality pairs of directed graphs CoRR (2012)
Nathalie Paul, Claude Tardif
The chromatic Ramsey number of odd wheels. J. Graph Theory 69 (2) (2012)
Péter L. Erdös, Claude Tardif, Gábor Tardos
Caterpillar dualities and regular languages CoRR (2012)
Jan Foniok, Jaroslav Nesetril, Claude Tardif
Interleaved adjoints of directed graphs. Eur. J. Comb. 32 (7) (2011)
Cynthia Loten, Claude Tardif
Near-Unanimity Polymorphisms on Structures with Finite Duality. SIAM J. Discret. Math. 25 (2) (2011)
Claude Tardif
Hedetniemi's Conjecture and Dense Boolean Lattices. Order 28 (2) (2011)
Jan Foniok, Jaroslav Nesetril, Ales Pultr, Claude Tardif
Dualities and Dual Pairs in Heyting Algebras. Order 27 (3) (2010)
Gábor Kun, Claude Tardif
Homomorphisms of random paths. Eur. J. Comb. 31 (3) (2010)
Jaroslav Nesetril, Claude Tardif
Path homomorphisms, graph colorings, and boolean matrices. J. Graph Theory 63 (3) (2010)
Anthony Bonato, Gena Hahn, Claude Tardif
-cop-win graphs. J. Graph Theory 65 (4) (2010)
Jan Foniok, Jaroslav Nesetril, Claude Tardif
Interleaved adjoints on directed graphs. CoRR (2009)
Jan Foniok, Claude Tardif
Adjoint functors and tree duality. Discret. Math. Theor. Comput. Sci. 11 (2) (2009)
Jaroslav Nesetril, Claude Tardif
A dualistic approach to bounding the chromatic number of a graph. Eur. J. Comb. 29 (1) (2008)
Cynthia Loten, Claude Tardif
Majority functions on structures with finite duality. Eur. J. Comb. 29 (4) (2008)
Jan Foniok, Jaroslav Nesetril, Claude Tardif
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures. Eur. J. Comb. 29 (4) (2008)
Zhongyuan Che, Karen L. Collins, Claude Tardif
Odd-angulated graphs and cancelling factors in box products. J. Graph Theory 58 (3) (2008)
Benoît Larose, Cynthia Loten, Claude Tardif
A Characterisation of First-Order Constraint Satisfaction Problems CoRR (2007)
Jan Foniok, Jaroslav Nesetril, Claude Tardif
On Finite Maximal Antichains in the Homomorphism Order. Electron. Notes Discret. Math. 29 (2007)
Benoît Larose, Cynthia Loten, Claude Tardif
A Characterisation of First-Order Constraint Satisfaction Problems. Log. Methods Comput. Sci. 3 (4) (2007)
Reza Naserasr, Claude Tardif
The chromatic covering number of a graph. J. Graph Theory 51 (3) (2006)
Anthony Bonato, Claude Tardif
Mutually embeddable graphs and the tree alternative conjecture. J. Comb. Theory, Ser. B 96 (6) (2006)
Benoît Larose, Cynthia Loten, Claude Tardif
A Characterisation of First-Order Constraint Satisfaction Problems. LICS (2006)
Jan Foniok, Jaroslav Nesetril, Claude Tardif
Generalised Dualities and Finite Maximal Antichains. WG (2006)
Claude Tardif, David L. Wehlau
Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function. J. Graph Theory 51 (1) (2006)
Claude Tardif
The Fractional Chromatic Number Of The Categorical Product Of Graphs. Comb. 25 (5) (2005)
Claude Tardif
Multiplicative graphs and semi-lattice endomorphisms in the category of graphs. J. Comb. Theory, Ser. B 95 (2) (2005)
Jaroslav Nesetril, Claude Tardif
Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality. SIAM J. Discret. Math. 19 (4) (2005)
Lucien Haddad, Claude Tardif
A clone-theoretic formulation of the Erdös-Faber-Lovász conjecture. Discuss. Math. Graph Theory 24 (3) (2004)
Jaroslav Nesetril, Claude Tardif
On maximal finite antichains in the homomorphism order of directed graphs. Discuss. Math. Graph Theory 23 (2) (2003)
Anthony Bonato, Claude Tardif
Large families of mutually embeddable vertex-transitive graphs. J. Graph Theory 43 (2) (2003)
Claude Tardif, Xuding Zhu
The level of nonmultiplicativity of graphs. Discret. Math. 244 (1-3) (2002)
Claude Tardif, Xuding Zhu
On Hedetniemi's conjecture and the colour template scheme. Discret. Math. 253 (1-3) (2002)
Benoît Larose, Claude Tardif
Projectivity and independent sets in powers of graphs. J. Graph Theory 40 (3) (2002)
Jaroslav Nesetril, Claude Tardif
Density via duality. Theor. Comput. Sci. 287 (2) (2002)
Claude Tardif
Chromatic Numbers of Products of Tournaments: FractionalAspects of Hedetniemi's Conjecture. Graphs, Morphisms and Statistical Physics (2001)
Claude Tardif
Fractional chromatic numbers of cones over graphs. J. Graph Theory 38 (2) (2001)
Jaroslav Nesetril, Claude Tardif
Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations). J. Comb. Theory, Ser. B 80 (1) (2000)
Benoît Larose, Claude Tardif
Hedetniemi's Conjecture and the Retracts of a Product of Graphs. Comb. 20 (4) (2000)
Claude Tardif
Graph products and the chromatic difference sequence of vertex-transitive graphs. Discret. Math. 185 (1-3) (1998)
Benoît Larose, François Laviolette, Claude Tardif
On Normal Cayley Graphs and Hom-idempotent Graphs. Eur. J. Comb. 19 (7) (1998)
Jaroslav Nesetril, Claude Tardif
Density. Contemporary Trends in Discrete Mathematics (1997)
Claude Tardif
A fixed box theorem for the cartesian product of graphs and metric spaces. Discret. Math. 171 (1-3) (1997)
Claude Tardif
On compact median graphs. J. Graph Theory 23 (4) (1996)
Claude Tardif
Prefibers and the cartesian product of metric spaces. Discret. Math. 109 (1-3) (1992)