Paths with two blocks in $n$-chromatic digraphs

Louigi Addario-Berry; Stéphan Thomassé; Frédéric Havet

Reports

Paths with two blocks in $n$-chromatic digraphs

Louigi Addario-Berry ¹ Stéphan Thomassé ^{1, 2} Frédéric Havet ¹

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

Domain :

Computer Science [cs] / Other [cs.OH]

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

Paths with two blocks in $n$-chromatic digraphs

Files

Identifiers

Collections

Citation

Export

Metrics

323

262

Contact Legal Notice Personal Data

Paths with two blocks in $n$-chromatic digraphs

Files

Identifiers

Collections

Citation

Export

Share

Metrics

323

262

Contact Legal Notice Personal Data