Acyclic Coloring
Acyclic Coloring is a proper vertex coloring of a graph in which every pair of color classes induces a forest, thereby ensuring that no bichromatic cycles exist.
110
Publications
4.9K
Citations
172
Authors
112
Institutions
Publications per year
2017–2026
4
Parents
110
Acyclic colorings of planar graphs
Branko Grünbaum · Israel Journal of Mathematics · 1973 · 406 citations
Beck′s Coloring of a Commutative Ring
D. D. Anderson, Muhammad Moazzam Naseer · Journal of Algebra · 1993 · 384 citations
On acyclic colorings of planar graphs
O. V. Borodin · Discrete Mathematics · 1979 · 265 citations
On acyclic colorings of planar graphs
O. V. Borodin · Discrete Mathematics · 2006 · 236 citations
Noga Alon, Colin McDiarmid, Bruce Reed · Random Structures and Algorithms · 1991 · 232 citations
1–5 of 110
172
Laboratoire Bordelais de Recherche en Informatique, France
9 publications · 388 citations
9
h-index
8
h-index
6
h-index
6
h-index
6
h-index
1–5 of 172
112
Université de Bordeaux
Bordeaux, France
13 h-index
26 publications
908 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
13 h-index
27 publications
929 citations
Institut Polytechnique de Bordeaux
Bordeaux, France
11 h-index
23 publications
853 citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
19 publications
563 citations

Zhejiang Normal University
Jinhua, China
7 h-index
15 publications
288 citations

Indian Institute of Science Bangalore
Bengaluru, India
6 h-index
12 publications
366 citations
Shandong University
Jinan, China
6 h-index
17 publications
493 citations

Tel Aviv University
Tel Aviv, Israel
5 h-index
7 publications
673 citations
1–8 of 112
16 publications · 544 citations
14
h-index
17 publications · 993 citations
14
h-index
11 publications · 414 citations
11
h-index
6 publications · 239 citations
6
h-index
5 publications · 97 citations
5
h-index
1–5