Claude Tardif

Orcid: 0000-0003-3855-989X

According to our database1, Claude Tardif authored at least 60 papers between 1992 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The Chromatic Number of the Product of 5-Chromatic Graphs can be 4.
Comb., December, 2023

2022
Counterexamples to Hedetniemi's Conjecture with Large Fractional Chromatic Numbers.
Graphs Comb., 2022

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

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).
PhD thesis, 2020

Topologically 4-chromatic graphs and signatures of odd cycles.
J. Graph Theory, 2020

2019
Hedetniemi's Conjecture and Strongly Multiplicative Graphs.
SIAM J. Discret. Math., 2019

A Note on Hedetniemi's Conjecture, Stahl's Conjecture and the Poljak-Rödl Function.
Electron. J. Comb., 2019

2018
Hedetniemi's Conjecture and Adjoint Functors in Thin Categories.
Appl. Categorical Struct., 2018

2017
Logical compactness and constraint satisfaction problems.
Log. Methods Comput. Sci., 2017

Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers.
J. Comb. Theory, Ser. B, 2017

Regular families of forests, antichains and duality pairs of relational structures.
Comb., 2017

2015
Fractional aspects of the Erdös-Faber-Lovász Conjecture.
Discuss. Math. Graph Theory, 2015

Digraph functors which admit both left and right adjoints.
Discret. Math., 2015

Homomorphisms of binary Cayley graphs.
Discret. Math., 2015

2014
Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case.
SIAM J. Discret. Math., 2014

2013
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case.
SIAM J. Discret. Math., 2013

Caterpillar Dualities and Regular Languages.
SIAM J. Discret. Math., 2013

On Infinite-finite Duality Pairs of Directed Graphs.
Order, 2013

Adjoint functors in graph theory
CoRR, 2013

Colourful Theorems and Indices of Homomorphism Complexes.
Electron. J. Comb., 2013

2012
The chromatic Ramsey number of odd wheels.
J. Graph Theory, 2012

On infinite-finite tree-duality pairs of relational structures
CoRR, 2012

2011
Near-Unanimity Polymorphisms on Structures with Finite Duality.
SIAM J. Discret. Math., 2011

Hedetniemi's Conjecture and Dense Boolean Lattices.
Order, 2011

Interleaved adjoints of directed graphs.
Eur. J. Comb., 2011

2010
Dualities and Dual Pairs in Heyting Algebras.
Order, 2010

Path homomorphisms, graph colorings, and boolean matrices.
J. Graph Theory, 2010

Large classes of infinite <i>k</i>-cop-win graphs.
J. Graph Theory, 2010

Homomorphisms of random paths.
Eur. J. Comb., 2010

2009
Adjoint functors and tree duality.
Discret. Math. Theor. Comput. Sci., 2009

2008
Odd-angulated graphs and cancelling factors in box products.
J. Graph Theory, 2008

A dualistic approach to bounding the chromatic number of a graph.
Eur. J. Comb., 2008

Majority functions on structures with finite duality.
Eur. J. Comb., 2008

Generalised dualities and maximal finite antichains in the homomorphism order of relational structures.
Eur. J. Comb., 2008

2007
A Characterisation of First-Order Constraint Satisfaction Problems.
Log. Methods Comput. Sci., 2007

On Finite Maximal Antichains in the Homomorphism Order.
Electron. Notes Discret. Math., 2007

2006
Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function.
J. Graph Theory, 2006

The chromatic covering number of a graph.
J. Graph Theory, 2006

Mutually embeddable graphs and the tree alternative conjecture.
J. Comb. Theory, Ser. B, 2006

Generalised Dualities and Finite Maximal Antichains.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2005
Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality.
SIAM J. Discret. Math., 2005

Multiplicative graphs and semi-lattice endomorphisms in the category of graphs.
J. Comb. Theory, Ser. B, 2005

The Fractional Chromatic Number Of The Categorical Product Of Graphs.
Comb., 2005

2004
A clone-theoretic formulation of the Erdös-Faber-Lovász conjecture.
Discuss. Math. Graph Theory, 2004

2003
Large families of mutually embeddable vertex-transitive graphs.
J. Graph Theory, 2003

On maximal finite antichains in the homomorphism order of directed graphs.
Discuss. Math. Graph Theory, 2003

2002
Density via duality.
Theor. Comput. Sci., 2002

Projectivity and independent sets in powers of graphs.
J. Graph Theory, 2002

The level of nonmultiplicativity of graphs.
Discret. Math., 2002

On Hedetniemi's conjecture and the colour template scheme.
Discret. Math., 2002

2001
Fractional chromatic numbers of cones over graphs.
J. Graph Theory, 2001

Chromatic Numbers of Products of Tournaments: FractionalAspects of Hedetniemi's Conjecture.
Proceedings of the Graphs, 2001

2000
Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations).
J. Comb. Theory, Ser. B, 2000

Hedetniemi's Conjecture and the Retracts of a Product of Graphs.
Comb., 2000

1998
On Normal Cayley Graphs and Hom-idempotent Graphs.
Eur. J. Comb., 1998

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

1997
A fixed box theorem for the cartesian product of graphs and metric spaces.
Discret. Math., 1997

Density.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996
On compact median graphs.
J. Graph Theory, 1996

1992
Prefibers and the cartesian product of metric spaces.
Discret. Math., 1992


  Loading...