Online Graph Coloring

Online Graph Coloring is a computational problem in graph theory where vertices of a graph are revealed sequentially and must be irrevocably assigned colors from a fixed palette in real time, such that no two adjacent vertices share the same color, with the coloring decision constrained by the lack of knowledge about future vertices.

33

Publications

960

Citations

84

Authors

48

Institutions

Publications per year

2017–2026

1

Authors

84

  1. SS
    Shakhar Smorodinsky

    Tel Aviv University, Israel

    4 publications · 93 citations

    4

    h-index

  2. AB
    Amotz Bar-Noy

    IBM (United States), United States

    3 publications · 75 citations

    3

    h-index

  3. PC
    Panagiotis Cheilaris

    Ben-Gurion University of the Negev, Israel

    3 publications · 75 citations

    3

    h-index

  4. RS
    Reto Spöhel

    ETH Zurich, Switzerland

    3 publications · 72 citations

    3

    h-index

  5. MG
    Maya Gokhale

    Lawrence Livermore National Laboratory, United States

    2 publications · 40 citations

    2

    h-index

1–5 of 84

Venues

  1. Journal of Algorithms

    3 publications · 104 citations

    3

    h-index

  2. Combinatorics Probability Computing

    3 publications · 86 citations

    3

    h-index

  3. Discrete Applied Mathematics

    2 publications · 66 citations

    2

    h-index

  4. The Electronic Journal of Combinatorics

    2 publications · 38 citations

    2

    h-index

  5. ACM Transactions on Algorithms

    TALG · 2 publications · 49 citations

    2

    h-index

1–5