Uniquely D-colourable digraphs with large girth

8Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Let C and D be digraphs. A mapping f : V(D) → V(C) is a C-colouring if for every arc uv of D, either f (u) f (v) is an arc of C or f (u) = f (v), and the preimage of every vertex of C induces an acyclic subdigraph in D. We say that D is C-colourable if it admits a C-colouring and that D is uniquely C-colourable if it is surjectively C-colourable and any two C-colourings of D differ by an automorphism of C. We prove that if a digraph D is not C-colourable, then there exist digraphs of arbitrarily large girth that are D-colourable but not C-colourable. Moreover, for every digraph D that is uniquely D-colourable, there exists a uniquely D-colourable digraph of arbitrarily large girth. In particular, this implies that for every rational number r ≥ 1, there are uniquely circularly r-colourable digraphs with arbitrarily large girth. © Canadian Mathematical Society 2011.

References Powered by Scopus

244Citations
33Readers

On chromatic number of finite set-systems

122Citations
4Readers
Get full text
80Citations
8Readers
Get full text

Cited by Powered by Scopus

16Citations
7Readers
Get full text
10Citations
N/AReaders

Digraph coloring and distance to acyclicity

4Citations
1Readers
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Harutyunyan, A., Kayll, P. M., Mohar, B., & Rafferty, L. (2012). Uniquely D-colourable digraphs with large girth. Canadian Journal of Mathematics, 64(6), 1310–1328. https://doi.org/10.4153/CJM-2011-084-9

Readers over time

‘13‘16‘1700.511.52

Readers' Seniority

Tooltip

Professor / Associate Prof. 3

60%

Lecturer / Post doc 1

20%

PhD / Post grad / Masters / Doc 1

20%

Readers' Discipline

Tooltip

Mathematics 3

60%

Agricultural and Biological Sciences 1

20%

Chemistry 1

20%

Save time finding and organizing research with Mendeley

Sign up for free
0