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

Authors

172

  1. AR
    André Raspaud

    Laboratoire Bordelais de Recherche en Informatique, France

    9 publications · 388 citations

    9

    h-index

  2. QS
    Qiaojun Shu

    Zhejiang Normal University, China

    8 publications · 138 citations

    8

    h-index

  3. OV
    O. V. Borodin

    Sobolev Institute of Mathematics, Russia

    6 publications · 748 citations

    6

    h-index

  4. MB
    Manu Basavaraju

    National Institute of Technology Karnataka, India

    6 publications · 183 citations

    6

    h-index

  5. LS
    L. Sunil Chandran

    Indian Institute of Science Bangalore, India

    6 publications · 183 citations

    6

    h-index

1–5 of 172

Venues

  1. Journal of Graph Theory

    16 publications · 544 citations

    14

    h-index

  2. Discrete Mathematics

    17 publications · 993 citations

    14

    h-index

  3. Information Processing Letters

    11 publications · 414 citations

    11

    h-index

  4. Discrete Applied Mathematics

    6 publications · 239 citations

    6

    h-index

  5. Journal of Combinatorial Theory Series B

    5 publications · 97 citations

    5

    h-index

1–5