Abstract
The dichromatic number d k ( D) of a diagraph D is the minimum number of colours needed to colour V( D) in such a way that no monochromatic directed cycle is obtained. A digraph D is called uniquely colourable if any acyclic d k ( D)-colouring of V( D) induces the same partition of V( D). In this paper we construct an infinite family of uniquely colourable m-dichromatic oriented graphs for all m ⩾ 2.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
