Uniquely D-colourable digraphs with large girth

Details Uniquely D-colourable digraphs with large girth Uniquely D-colourable digraphs with large girth

2011-09-23

arxiv.org/abs/1109.5208v1

Mathematics

Combinatorics

21 pages, 0 figures To be published in Canadian Journal of Mathematics

Scientific paper

Let C and D be digraphs. A mapping $f:V(D)\to 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\geq 1$, there are uniquely circularly r-colourable digraphs with arbitrarily large girth.

Affiliated with

Also associated with

No associations

Rating

Uniquely D-colourable digraphs with large girth does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Uniquely D-colourable digraphs with large girth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uniquely D-colourable digraphs with large girth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-601903