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
Parents
12
Line-Coloring of Signed Graphs.
Gary Chartrand, Mehdi Behzad · Elemente Der Mathematik · 1969 · 45 citations
On the Coloring of Signed Graphs.
F. Harary, Dorwin Cartwright · Elemente Der Mathematik · 1968 · 44 citations
Circular coloring of signed graphs
Yingli Kang, Eckhard Steffen · Journal of Graph Theory · 2017 · 32 citations
Nowhere-Zero 3-Flows in Signed Graphs
Yezhou Wu, Dong Ye, Wenan Zang et al. · SIAM Journal on Discrete Mathematics · 2014 · 18 citations · Full text
1–5 of 12
28
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 28
19
West Virginia University
Morgantown, United States
2 h-index
2 publications
32 citations

Middle Tennessee State University
Murfreesboro, United States
2 h-index
2 publications
32 citations
Université Paris Cité
Paris, France
2 h-index
2 publications
27 citations

Paderborn University
Paderborn, Germany
2 h-index
3 publications
78 citations
Délégation Paris 7
Bagnolet, France
2 h-index
2 publications
27 citations
Institut Polytechnique de Bordeaux
Bordeaux, France
1 h-index
1 publications
11 citations

Zhejiang Normal University
Jinhua, China
1 h-index
1 publications
16 citations
Institut de Recherche en Informatique Fondamentale
Paris, France
1 h-index
1 publications
11 citations
1–8 of 19
2 publications · 27 citations
2
h-index
2 publications · 89 citations
2
h-index
2 publications · 64 citations
2
h-index
1 publications · 14 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5