Dynamic Graph Coloring

Dynamic Graph Coloring is a dynamic graph algorithmic problem that extends classical graph coloring by requiring the maintenance of a proper vertex coloring under a sequence of edge insertions, edge deletions, or vertex updates, ensuring adjacent vertices remain differently colored while minimizing recoloring efforts or color count over time.

29

Publications

824

Citations

78

Authors

43

Institutions

Publications per year

2017–2026

11

Authors

78

  1. DD
    Dafik Dafik

    Universitas Jember, Indonesia

    5 publications · 76 citations

    5

    h-index

  2. MG
    M. Ghanbari

    Sharif University of Technology, Iran

    3 publications · 117 citations

    3

    h-index

  3. SJ
    Sogol Jahanbekam

    Zhejiang Normal University, China

    3 publications · 129 citations

    3

    h-index

  4. SA
    Saieed Akbari

    Sharif University of Technology, Iran

    3 publications · 117 citations

    3

    h-index

  5. MR
    Matei Ripeanu

    University of British Columbia, Canada

    2 publications · 40 citations

    2

    h-index

1–5 of 78

Venues

  1. Discrete Applied Mathematics

    6 publications · 307 citations

    6

    h-index

  2. Journal of Physics Conference Series

    2 publications · 32 citations

    2

    h-index

  3. Discrete Mathematics

    2 publications · 47 citations

    2

    h-index

  4. 1

    h-index

  5. Symbolic and Numeric Algorithms for Scientific Computing

    Conference · 1 publications · 19 citations

    1

    h-index

1–5