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 metadatas

Cited literature [9 references]  Display  Hide  Download
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00197151
Contributor : Stephan Thomasse <>
Submitted on : Friday, December 14, 2007 - 1:40:19 PM
Last modification on : Thursday, February 7, 2019 - 4:52:08 PM
Long-term archiving on: Monday, April 12, 2010 - 7:30:33 AM

File

Pkl.pdf

Identifiers

Collections

CNRS | INRIA | UNICE | I3S | ALGCO | LIRMM | TDS-MACS | MIPS | UNIV-MONTPELLIER | UNIV-COTEDAZUR

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

429

Files downloads

235

Contact

Informations

CCSD