Precoloring Extension

Precoloring Extension is a graph coloring problem variant in which a partial coloring of a graph is given and the task is to extend this precoloring to a full proper coloring of the entire graph using a specified number of colors.

19

Publications

977

Citations

18

Authors

14

Institutions

Publications per year

2017–2026

1

Authors

18

  1. DM
    Dániel Marx

    Hungarian Academy of Sciences, Hungary

    3 publications · 176 citations

    3

    h-index

  2. MH
    Mihály Hujter

    University of Miskolc, Hungary

    3 publications · 293 citations

    3

    h-index

  3. MO
    Michael O. Albertson

    Smith College, United States

    3 publications · 52 citations

    3

    h-index

  4. ZT
    Zs. Tuza

    Hungarian Academy of Sciences, Hungary

    3 publications · 293 citations

    3

    h-index

  5. JP
    Joan P. Hutchinson

    Macalester College, United States

    2 publications · 27 citations

    2

    h-index

1–5 of 18

Venues

  1. Journal of Graph Theory

    3 publications · 71 citations

    3

    h-index

  2. Combinatorics Probability Computing

    2 publications · 92 citations

    2

    h-index

  3. Discrete Mathematics

    2 publications · 171 citations

    2

    h-index

  4. arXiv (Cornell University)

    Repository · 2 publications · 37 citations

    2

    h-index

  5. Ars Mathematica Contemporanea

    1 publications · 11 citations

    1

    h-index

1–5