Paths with two blocks in n-chromatic digraphs

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

doi:10.1016/j.jctb.2006.10.001

Journal Articles Journal of Combinatorial Theory, Series B Year : 2007

Paths with two blocks in n-chromatic digraphs

(1) , (2) ,

1
2

Stéphan Thomassé

Function : Author
PersonId : 171719
IdHAL : stephan-thomasse
ORCID : 0000-0002-7090-1790
IdRef : 077482476

Algorithmes, Graphes et Combinatoire

Frédéric Havet

Function : Author
PersonId : 9383
IdHAL : frederic-havet
ORCID : 0000-0002-3447-8112
IdRef : 110354842

Algorithms, simulation, combinatorics and optimization for telecommunications

Louigi Addario-Berry

Function : Author

Abstract

We show that every oriented path of order n>=4 with two blocks is contained in every n-chromatic digraph.

Domains

Discrete Mathematics [cs.DM]

Fichier principal

Pkl.pdf (151.44 Ko)

Stephan Thomasse : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00197151

Submitted on : Friday, December 14, 2007-1:40:19 PM

Last modification on : Monday, February 26, 2024-11:22:07 AM

Long-term archiving on : Monday, April 12, 2010-7:30:33 AM

Dates and versions

lirmm-00197151 , version 1 (14-12-2007)

Identifiers

HAL Id : lirmm-00197151 , version 1
DOI : 10.1016/j.jctb.2006.10.001

Cite

Stéphan Thomassé, Frédéric Havet, Louigi Addario-Berry. Paths with two blocks in n-chromatic digraphs. Journal of Combinatorial Theory, Series B, 2007, 97, pp.620-626. ⟨10.1016/j.jctb.2006.10.001⟩. ⟨lirmm-00197151⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

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

226 View

229 Download

Paths with two blocks in n-chromatic digraphs

Abstract

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share