Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

A Study of k-dipath Colourings of Orient...

Duffy, Christopher...

Free

Share this content

A Study of k-dipath Colourings of Oriented Graphs by Duffy, Christopher ( Author )

Content Provider	Lemonjar Open Access
Publisher	N.A
Publication Date	28-05-2016
Summary	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.
ISBN	-
Item Type	Article
File Type	pdf
File Size	36.88 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	https://arxiv.org/abs/1605.08905

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Duffy, Christopher. A Study of k-dipath Colourings of Oriented Graphs. N.A. May 28, 2016. Accessed September 20, 2024. https://online.provdatabase.com/cite/22856

APA 7th EditionReferences

Duffy, Christopher. (2016). A Study of k-dipath Colourings of Oriented Graphs. N.A. https://online.provdatabase.com/cite/22856

Chicago 17th EditionReferences

Duffy, Christopher. A Study of k-dipath Colourings of Oriented Graphs. N.A. 2016. https://online.provdatabase.com/cite/22856

HarvardReferences

Duffy, Christopher. (2016). A Study of k-dipath Colourings of Oriented Graphs. [Online]. N.A. Available from: https://online.provdatabase.com/cite/22856. (Accessed 20 September 2024).

Harvard AustraliaReferences

Duffy, Christopher, 2016, A Study of k-dipath Colourings of Oriented Graphs, N.A, viewed 20 September 2024, <https://online.provdatabase.com/cite/22856>

MLA 9th EditionWorks Cited

Duffy, Christopher. A Study of k-dipath Colourings of Oriented Graphs. N.A, 2016. PROV Database, https://online.provdatabase.com/cite/22856.

Share this eBook