Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I have to prove that if $D$ is a m-coloured digraph, then $K(D) = K\big(C(D)\big)$

Where $C(D)$ is the chromatic transitive closure of $D$, which is a multidigraph with the same nodes and arcs of $D$ plus those arcs of the form $(a,b)$ iff there is a monochromatic directed path from $a$ to $b$ in $D$.

I'm only asking for the definition of $K(D)$, which might be called something like the Chromatic class digraph of a m-coloured digraph.

I know this is a vague definition, but any help would be highly appreciated.

share|improve this question

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.