default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaude Tardif
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j56]Claude Tardif
:
Chromatic Ramsey numbers of generalised Mycielski graphs. Discuss. Math. Graph Theory 44(4): 1327-1339 (2024)- [j55]Claude Tardif:
Mutual embeddability in groups, trees, and spheres. J. Comb. Theory B 168: 1-10 (2024) - 2023
- [j54]Claude Tardif:
The Chromatic Number of the Product of 5-Chromatic Graphs can be 4. Comb. 43(6): 1067-1073 (2023) - 2022
- [j53]Claude Tardif:
The Chromatic Number of the Product of 14-Chromatic Graphs Can BE 13. Comb. 42(2): 301-308 (2022) - [j52]Claude Tardif:
Counterexamples to Hedetniemi's Conjecture with Large Fractional Chromatic Numbers. Graphs Comb. 38(6): 171 (2022) - 2020
- [b1]Claude Tardif:
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). University of Paris 8 Vincennes-Saint-Denis, France, 2020 - [j51]Gord Simons, Claude Tardif, David L. Wehlau:
Topologically 4-chromatic graphs and signatures of odd cycles. J. Graph Theory 95(2): 290-307 (2020)
2010 – 2019
- 2019
- [j50]Claude Tardif, Xuding Zhu:
A Note on Hedetniemi's Conjecture, Stahl's Conjecture and the Poljak-Rödl Function. Electron. J. Comb. 26(4): 4 (2019) - [j49]Claude Tardif, Marcin Wrochna:
Hedetniemi's Conjecture and Strongly Multiplicative Graphs. SIAM J. Discret. Math. 33(4): 2218-2250 (2019) - 2018
- [j48]Jan Foniok, Claude Tardif:
Hedetniemi's Conjecture and Adjoint Functors in Thin Categories. Appl. Categorical Struct. 26(1): 113-128 (2018) - 2017
- [j47]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): 651-672 (2017) - [j46]Gord Simons, Claude Tardif, David L. Wehlau:
Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers. J. Comb. Theory B 122: 776-793 (2017) - [j45]Danny Rorabaugh, Claude Tardif, David L. Wehlau:
Logical compactness and constraint satisfaction problems. Log. Methods Comput. Sci. 13(1) (2017) - 2015
- [j44]Jan Foniok, Claude Tardif:
Digraph functors which admit both left and right adjoints. Discret. Math. 338(4): 527-535 (2015) - [j43]Laurent Beaudou, Reza Naserasr, Claude Tardif:
Homomorphisms of binary Cayley graphs. Discret. Math. 338(12): 2539-2544 (2015) - [j42]John Bosica, Claude Tardif:
Fractional aspects of the Erdös-Faber-Lovász Conjecture. Discuss. Math. Graph Theory 35(1): 197-202 (2015) - 2014
- [j41]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): 817-834 (2014) - 2013
- [j40]Gábor Simonyi, Claude Tardif, Ambrus Zsbán:
Colourful Theorems and Indices of Homomorphism Complexes. Electron. J. Comb. 20(1): 10 (2013) - [j39]Péter L. Erdös, Claude Tardif, Gábor Tardos:
On Infinite-finite Duality Pairs of Directed Graphs. Order 30(3): 807-819 (2013) - [j38]Péter L. Erdös, Claude Tardif, Gábor Tardos:
Caterpillar Dualities and Regular Languages. SIAM J. Discret. Math. 27(3): 1287-1294 (2013) - [j37]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): 1940-1963 (2013) - [i7]Jan Foniok, Claude Tardif:
Digraph functors which admit both left and right adjoints. CoRR abs/1304.2204 (2013) - [i6]Jan Foniok, Claude Tardif:
Adjoint functors in graph theory. CoRR abs/1304.2215 (2013) - 2012
- [j36]Nathalie Paul, Claude Tardif:
The chromatic Ramsey number of odd wheels. J. Graph Theory 69(2): 198-205 (2012) - [i5]Péter L. Erdös, Claude Tardif, Gábor Tardos:
On infinite-finite duality pairs of directed graphs. CoRR abs/1203.1257 (2012) - [i4]Péter L. Erdös, Claude Tardif, Gábor Tardos:
Caterpillar dualities and regular languages. CoRR abs/1203.1347 (2012) - [i3]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 abs/1207.4402 (2012) - 2011
- [j35]Jan Foniok, Jaroslav Nesetril, Claude Tardif:
Interleaved adjoints of directed graphs. Eur. J. Comb. 32(7): 1018-1024 (2011) - [j34]Claude Tardif:
Hedetniemi's Conjecture and Dense Boolean Lattices. Order 28(2): 181-191 (2011) - [j33]Cynthia Loten, Claude Tardif:
Near-Unanimity Polymorphisms on Structures with Finite Duality. SIAM J. Discret. Math. 25(2): 490-496 (2011) - 2010
- [j32]Gábor Kun, Claude Tardif:
Homomorphisms of random paths. Eur. J. Comb. 31(3): 688-693 (2010) - [j31]Jaroslav Nesetril, Claude Tardif:
Path homomorphisms, graph colorings, and boolean matrices. J. Graph Theory 63(3): 198-209 (2010) - [j30]Anthony Bonato, Gena Hahn, Claude Tardif:
Large classes of infinite k-cop-win graphs. J. Graph Theory 65(4): 334-342 (2010) - [j29]Jan Foniok, Jaroslav Nesetril, Ales Pultr, Claude Tardif:
Dualities and Dual Pairs in Heyting Algebras. Order 27(3): 327-342 (2010)
2000 – 2009
- 2009
- [j28]Jan Foniok, Claude Tardif:
Adjoint functors and tree duality. Discret. Math. Theor. Comput. Sci. 11(2): 97-110 (2009) - [i2]Jan Foniok, Jaroslav Nesetril, Claude Tardif:
Interleaved adjoints on directed graphs. CoRR abs/0905.1200 (2009) - 2008
- [j27]Jaroslav Nesetril, Claude Tardif:
A dualistic approach to bounding the chromatic number of a graph. Eur. J. Comb. 29(1): 254-260 (2008) - [j26]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) - [j25]Cynthia Loten, Claude Tardif:
Majority functions on structures with finite duality. Eur. J. Comb. 29(4): 979-986 (2008) - [j24]Zhongyuan Che, Karen L. Collins, Claude Tardif:
Odd-angulated graphs and cancelling factors in box products. J. Graph Theory 58(3): 221-238 (2008) - 2007
- [j23]Jan Foniok, Jaroslav Nesetril, Claude Tardif:
On Finite Maximal Antichains in the Homomorphism Order. Electron. Notes Discret. Math. 29: 389-396 (2007) - [j22]Benoît Larose, Cynthia Loten, Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems. Log. Methods Comput. Sci. 3(4) (2007) - [i1]Benoît Larose, Cynthia Loten, Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems. CoRR abs/0707.2562 (2007) - 2006
- [j21]Anthony Bonato, Claude Tardif:
Mutually embeddable graphs and the tree alternative conjecture. J. Comb. Theory B 96(6): 874-880 (2006) - [j20]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): 33-36 (2006) - [j19]Reza Naserasr, Claude Tardif:
The chromatic covering number of a graph. J. Graph Theory 51(3): 199-204 (2006) - [c4]Benoît Larose, Cynthia Loten, Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems. LICS 2006: 201-210 - [c3]Jan Foniok, Jaroslav Nesetril, Claude Tardif:
Generalised Dualities and Finite Maximal Antichains. WG 2006: 27-36 - 2005
- [j18]Claude Tardif:
The Fractional Chromatic Number Of The Categorical Product Of Graphs. Comb. 25(5): 625-632 (2005) - [j17]Claude Tardif:
Multiplicative graphs and semi-lattice endomorphisms in the category of graphs. J. Comb. Theory B 95(2): 338-345 (2005) - [j16]Jaroslav Nesetril, Claude Tardif:
Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality. SIAM J. Discret. Math. 19(4): 914-920 (2005) - 2004
- [j15]Lucien Haddad, Claude Tardif:
A clone-theoretic formulation of the Erdös-Faber-Lovász conjecture. Discuss. Math. Graph Theory 24(3): 545-549 (2004) - 2003
- [j14]Jaroslav Nesetril, Claude Tardif:
On maximal finite antichains in the homomorphism order of directed graphs. Discuss. Math. Graph Theory 23(2): 325-332 (2003) - [j13]Anthony Bonato, Claude Tardif:
Large families of mutually embeddable vertex-transitive graphs. J. Graph Theory 43(2): 99-106 (2003) - 2002
- [j12]Claude Tardif, Xuding Zhu:
The level of nonmultiplicativity of graphs. Discret. Math. 244(1-3): 461-471 (2002) - [j11]Claude Tardif, Xuding Zhu:
On Hedetniemi's conjecture and the colour template scheme. Discret. Math. 253(1-3): 77-85 (2002) - [j10]Benoît Larose, Claude Tardif:
Projectivity and independent sets in powers of graphs. J. Graph Theory 40(3): 162-171 (2002) - [j9]Jaroslav Nesetril, Claude Tardif:
Density via duality. Theor. Comput. Sci. 287(2): 585-591 (2002) - 2001
- [j8]Claude Tardif:
Fractional chromatic numbers of cones over graphs. J. Graph Theory 38(2): 87-94 (2001) - [c2]Claude Tardif:
Chromatic Numbers of Products of Tournaments: FractionalAspects of Hedetniemi's Conjecture. Graphs, Morphisms and Statistical Physics 2001: 171-175 - 2000
- [j7]Benoît Larose, Claude Tardif:
Hedetniemi's Conjecture and the Retracts of a Product of Graphs. Comb. 20(4): 531-544 (2000) - [j6]Jaroslav Nesetril, Claude Tardif:
Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations). J. Comb. Theory B 80(1): 80-97 (2000)
1990 – 1999
- 1998
- [j5]Claude Tardif:
Graph products and the chromatic difference sequence of vertex-transitive graphs. Discret. Math. 185(1-3): 193-200 (1998) - [j4]Benoît Larose, François Laviolette, Claude Tardif:
On Normal Cayley Graphs and Hom-idempotent Graphs. Eur. J. Comb. 19(7): 867-881 (1998) - 1997
- [j3]Claude Tardif:
A fixed box theorem for the cartesian product of graphs and metric spaces. Discret. Math. 171(1-3): 237-248 (1997) - [c1]Jaroslav Nesetril, Claude Tardif:
Density. Contemporary Trends in Discrete Mathematics 1997: 229-235 - 1996
- [j2]Claude Tardif:
On compact median graphs. J. Graph Theory 23(4): 325-336 (1996) - 1992
- [j1]Claude Tardif:
Prefibers and the cartesian product of metric spaces. Discret. Math. 109(1-3): 283-288 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
