HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

Paths with two blocks in $n$-chromatic digraphs

Louigi Addario-Berry 1 Stéphan Thomassé 1, 2 Frédéric Havet 1
1 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
2 LAPCS - Laboratoire de Probabilités, Combinatoire et Statistique
Abstract : We show that every oriented path of order $n\geq4$ with two blocks is contained in every $n$-chromatic digraph.
Keywords : UNIVERSAL UNAVOIDABLE PATH CHROMATIC NUMBER
Document type :
Reports
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
https://hal.inria.fr/inria-00070325
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 8:07:07 PM
Last modification on : Friday, February 4, 2022 - 3:19:52 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:56:57 PM

Files

Vignette du document
RR-5688.pdf

Identifiers

  • HAL Id : inria-00070325, version 1

Collections

INRIA | INRIA-RRRT | CNRS | I3S | LARA | UNIV-COTEDAZUR | UNIV-LYON1 | UDL | INRIA2

Citation

Louigi Addario-Berry, Stéphan Thomassé, Frédéric Havet. Paths with two blocks in $n$-chromatic digraphs. [Research Report] RR-5688, INRIA. 2005, pp.8. ⟨inria-00070325⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

121

Files downloads

187

 

Contact                    Legal Notice                    Personal Data