Strong Coloring

Strong Coloring is a vertex coloring of a graph in which every pair of adjacent vertices receives distinct colors and every color class induces a matching, distinguishing it from standard graph colorings by enforcing both proper coloring and matching constraints on monochromatic subgraphs.

125

Publications

4.7K

Citations

267

Authors

155

Institutions

Publications per year

2017–2026

17

Authors

267

  1. AR
    André Raspaud

    Laboratoire Bordelais de Recherche en Informatique, France

    6 publications · 253 citations

    6

    h-index

  2. HH
    Hervé Hocquard

    Université de Bordeaux, France

    5 publications · 140 citations

    5

    h-index

  3. JL
    Jingwen Li

    Beihang University, China

    4 publications · 69 citations

    4

    h-index

  4. ZZ
    Zhang Zhong-fu

    Shenzhen Second People's Hospital, China

    4 publications · 281 citations

    4

    h-index

  5. GY
    Gexin Yu

    William & Mary, United States

    4 publications · 107 citations

    4

    h-index

1–5 of 267

Venues

  1. Discrete Mathematics

    24 publications · 866 citations

    17

    h-index

  2. Discrete Applied Mathematics

    11 publications · 382 citations

    11

    h-index

  3. Journal of Graph Theory

    5 publications · 115 citations

    5

    h-index

  4. Journal of Combinatorial Theory Series B

    5 publications · 254 citations

    5

    h-index

  5. Information Processing Letters

    5 publications · 259 citations

    5

    h-index

1–5