The digrundy number of digraphs
Por:
Araujo-Pardo, Gabriela, Jose Montellano-Ballesteros, Juan, Olsen, Mika, Rubio-Montiel, Christian
Publicada:
15 ago 2022
Resumen:
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). (C)
2022 Published by Elsevier B.V.
Filiaciones:
Araujo-Pardo, Gabriela:
Univ Nacl Autonoma Mexico, Inst Matemat, Mexico City, DF, Mexico
Jose Montellano-Ballesteros, Juan:
Univ Nacl Autonoma Mexico, Inst Matemat, Mexico City, DF, Mexico
Olsen, Mika:
Univ Autonoma Metropolitana Cuajimalpa, Dept Matemat Aplicadas & Sistemas, Mexico City, DF, Mexico
Rubio-Montiel, Christian:
Univ Nacl Autonoma Mexico, Div Matemat & Ingn, FES Acatlan, Naucalpan, Mexico
Green Submitted
|