Complete acyclic colorings
The electronic journal of combinatorics, Tome 27 (2020) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We study two parameters that arise from the dichromatic number and the vertex-arboricity in the same way that the achromatic number comes from the chromatic number. The adichromatic number of a digraph is the largest number of colors its vertices can be colored with such that every color induces an acyclic subdigraph but merging any two colors yields a monochromatic directed cycle. Similarly, the a-vertex arboricity of an undirected graph is the largest number of colors that can be used such that every color induces a forest but merging any two yields a monochromatic cycle. We study the relation between these parameters and their behavior with respect to other classical parameters such as degeneracy and most importantly feedback vertex sets.
DOI : 10.37236/8752
Classification : 05C15, 05C20
Mots-clés : adichromatic number of a digraph
@article{10_37236_8752,
     author = {Stefan Felsner and Winfried Hochst\"attler and Kolja Knauer and Raphael Steiner},
     title = {Complete acyclic colorings},
     journal = {The electronic journal of combinatorics},
     year = {2020},
     volume = {27},
     number = {2},
     doi = {10.37236/8752},
     zbl = {1441.05073},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/8752/}
}
TY  - JOUR
AU  - Stefan Felsner
AU  - Winfried Hochstättler
AU  - Kolja Knauer
AU  - Raphael Steiner
TI  - Complete acyclic colorings
JO  - The electronic journal of combinatorics
PY  - 2020
VL  - 27
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/8752/
DO  - 10.37236/8752
ID  - 10_37236_8752
ER  - 
%0 Journal Article
%A Stefan Felsner
%A Winfried Hochstättler
%A Kolja Knauer
%A Raphael Steiner
%T Complete acyclic colorings
%J The electronic journal of combinatorics
%D 2020
%V 27
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/8752/
%R 10.37236/8752
%F 10_37236_8752
Stefan Felsner; Winfried Hochstättler; Kolja Knauer; Raphael Steiner. Complete acyclic colorings. The electronic journal of combinatorics, Tome 27 (2020) no. 2. doi: 10.37236/8752

Cité par Sources :