Journal Articles Discrete Mathematics Year : 2005

The Categorical Product of Two 5-Chromatic Digraphs can be 3-Chromatic

Stéphane Bessy
Algorithmes, Graphes et Combinatoire
CV
Stéphan Thomassé
Algorithmes, Graphes et Combinatoire

Abstract

We provide an example of a 5-chromatic oriented graph $D$ such that the categorical product of $D$ and $TT_5$ is 3-chromatic, where $TT_5$ is the transitive tournament on 5 vertices.

Domains

Discrete Mathematics [cs.DM]
Fichier principal
Vignette du fichier
hedet.pdf (95) Télécharger le fichier

Stephan Thomasse  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00140331

Submitted on : Thursday, April 5, 2007-5:53:25 PM

Last modification on : Friday, March 24, 2023-2:52:48 PM

Long-term archiving on : Wednesday, April 7, 2010-3:11:34 AM

Download

Dates and versions

lirmm-00140331 , version 1 (05-04-2007)

Identifiers

Cite

Stéphane Bessy, Stéphan Thomassé. The Categorical Product of Two 5-Chromatic Digraphs can be 3-Chromatic. Discrete Mathematics, 2005, 305, pp.344-346. ⟨10.1016/j.disc.2004.01.023⟩. ⟨lirmm-00140331⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM TDS-MACS MIPS UNIV-MONTPELLIER
92 View
156 Download

Altmetric

Share

More