Paths with two blocks in $n$-chromatic digraphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

Paths with two blocks in $n$-chromatic digraphs

Abstract

We show that every oriented path of order $n\geq4$ with two blocks is contained in every $n$-chromatic digraph.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5688.pdf (138.99 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070325 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070325 , version 1

Cite

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⟩
149 View
30448 Download

Share

Gmail Facebook Twitter LinkedIn More