2 citations · 2 across the 2 of their papers we have counts for
4 papers
Hedetniemi's conjecture and strongly multiplicative graphs
Claude Tardif, Marcin Wrochna
A graph K is multiplicative if a homomorphism from any product G x H to K implies a homomorphism from G or from H. Hedetniemi's conjecture states that all cliques are multiplicativ…
Topologically -chromatic graphs and signatures of odd cycles
Gord Simons, Claude Tardif, David Wehlau
We investigate group-theoretic "signatures" of odd cycles of a graph, and their connections to topological obstructions to 3-colourability. In the case of signatures derived from f…
Homomorphisms of binary Cayley graphs
Laurent Beaudou, Reza Naserasr, Claude Tardif
A binary Cayley graph is a Cayley graph based on a binary group. In 1982, Payan proved that any non-bipartite binary Cayley graph must contain a generalized Mycielski graph of an o…
Adjoint functors in graph theory
Jan Foniok, Claude Tardif
We survey some uses of adjoint functors in graph theory pertaining to colourings, complexity reductions, multiplicativity, circular colourings and tree duality. The exposition of t…