Skip to Main content Skip to Navigation
Journal articles

Paths with two blocks in n-chromatic digraphs

Stéphan Thomassé 1 Frédéric Havet 2 Louigi Addario-Berry
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
2 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : We show that every oriented path of order n>=4 with two blocks is contained in every n-chromatic digraph.
Document type :
Journal articles
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Stephan Thomasse Connect in order to contact the contributor
Submitted on : Friday, December 14, 2007 - 1:40:19 PM
Last modification on : Monday, October 11, 2021 - 1:24:06 PM
Long-term archiving on: : Monday, April 12, 2010 - 7:30:33 AM




Stéphan Thomassé, Frédéric Havet, Louigi Addario-Berry. Paths with two blocks in n-chromatic digraphs. Journal of Combinatorial Theory, Series B, Elsevier, 2007, 97, pp.620-626. ⟨10.1016/j.jctb.2006.10.001⟩. ⟨lirmm-00197151⟩



Record views


Files downloads