Claude Tardif - RankMe

69 papers A* 1B 1Journal 64Unranked 2

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