Signed Graph Coloring

Signed Graph Coloring is a graph coloring method in which the assignment of colors to vertices of a signed graph is constrained by the sign of the edges, such that adjacent vertices connected by a positive edge receive different colors and those connected by a negative edge receive colors that are symmetric with respect to a central color, distinguishing it from classical graph coloring by incorporating edge polarity into the coloring rules.

12

Publications

259

Citations

28

Authors

19

Institutions

Publications per year

2017–2026

7

Authors

28

  1. RN
    Reza Naserasr

    Centre National de la Recherche Scientifique, France

    2 publications · 27 citations

    2

    h-index

  2. DC
    Dorwin Cartwright

    University of Michigan, United States

    2 publications · 56 citations

    2

    h-index

  3. DY
    Dong Ye

    Middle Tennessee State University, United States

    2 publications · 32 citations

    2

    h-index

  4. ES
    Eckhard Steffen

    Paderborn University, Germany

    2 publications · 46 citations

    2

    h-index

  5. CZ
    Cun‐Quan Zhang

    West Virginia University, United States

    1 publications · 18 citations

    1

    h-index

1–5 of 28

Venues

  1. The Electronic Journal of Combinatorics

    2 publications · 27 citations

    2

    h-index

  2. Elemente Der Mathematik

    2 publications · 89 citations

    2

    h-index

  3. Journal of Graph Theory

    2 publications · 64 citations

    2

    h-index

  4. Discrete Applied Mathematics

    1 publications · 14 citations

    1

    h-index

  5. Linear Algebra and its Applications

    1 publications · 11 citations

    1

    h-index

1–5