Abstract
We extend the Grundy number and the ochromatic number, parameters on graph colorings, to digraph colorings, we call them digrundy number and diochromatic number , respectively. First, we prove that for every digraph the diochromatic number equals the digrundy number (as happens for graphs). Then, we prove the interpolation property and the Nordhaus–Gaddum relations for the digrundy number, and improve the Nordhaus–Gaddum relations for the dichromatic and diachromatic numbers bounded previously by the authors in Araujo-Pardo et al. (2018).
Sign-in/Register to access full text options 
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.
