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
Abstract : We show that every oriented path of order $n\geq4$ with two blocks is contained in every $n$-chromatic digraph.
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 <>
Submitted on : Friday, May 19, 2006 - 8:07:07 PM
Last modification on : Monday, October 12, 2020 - 10:30:21 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:56:57 PM

Identifiers

  • HAL Id : inria-00070325, version 1

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⟩

Share

Metrics

Record views

323

Files downloads

262