The digrundy number of digraphs
From MaRDI portal
Publication:2142695
DOI10.1016/j.dam.2022.04.005zbMath1490.05092arXiv2103.11917OpenAlexW3136699130MaRDI QIDQ2142695
Gabriela Araujo-Pardo, Christian Rubio-Montiel, Juan José Montellano-Ballesteros, Mika Olsen
Publication date: 27 May 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.11917
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments
- Some perfect coloring properties of graphs
- The diachromatic number of digraphs
- The dichromatic number of a digraph
- Harmonious chromatic number of directed graphs
- Game-perfect digraphs
- The dichromatic polynomial of a digraph
- Coloring tournaments: from local to global
- A flow theory for the dichromatic number
- Disproof of a conjecture of Neumann-Lara
- Spectral radius of digraphs with given dichromatic number
- Dichromatic number, circulant tournaments and Zykov sums of digraphs
- DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER
- On Complementary Graphs
- On the equality of the grundy and ochromatic numbers of a graph
- Inequalities for the first-fit chromatic number
- Some extremal results in cochromatic and dichromatic theory
- Perfect Digraphs
- Planar Digraphs of Digirth Four are 2-Colorable
- Digraphs
This page was built for publication: The digrundy number of digraphs