A Study of k-dipath Colourings of Oriented Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2018

A Study of k-dipath Colourings of Oriented Graphs

Résumé

We examine t-colourings of oriented graphs in which, for a fixed integer k ≥ 1, vertices joined by a directed path of length at most k must be assigned different colours. A homomorphism model that extends the ideas of Sherk for the case k = 2 is described. Dichotomy theorems for the complexity of the problem of deciding, for fixed k and t, whether there exists such a t-colouring are proved.
Fichier non déposé

Dates et versions

hal-01330530 , version 1 (11-06-2016)

Identifiants

  • HAL Id : hal-01330530 , version 1

Citer

Christopher Duffy, Gary Macgillivray, Eric Sopena. A Study of k-dipath Colourings of Oriented Graphs. Discrete Mathematics and Theoretical Computer Science, 2018, 20 (1), pp.#6. ⟨hal-01330530⟩

Collections

CNRS TDS-MACS
41 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More