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
Parents
125
Gary Chartrand, Garry L. Johns, Kathleen A. McKeon et al. · Mathematica Bohemica · 2008 · 567 citations · Full text
Adjacent strong edge coloring of graphs
Zhang Zhong-fu, Linzhong Liu, Jianfang Wang · Applied Mathematics Letters · 2002 · 224 citations
T-colorings of graphs: recent results and open problems
Fred S. Roberts · Discrete Mathematics · 1991 · 209 citations
1–5 of 125
267
Laboratoire Bordelais de Recherche en Informatique, France
6 publications · 253 citations
6
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 267
155
Université de Bordeaux
Bordeaux, France
11 h-index
28 publications
923 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
10 h-index
19 publications
716 citations
Institut Polytechnique de Bordeaux
Bordeaux, France
8 h-index
21 publications
770 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
16 publications
535 citations

Hungarian Academy of Sciences
Budapest, Hungary
4 h-index
5 publications
122 citations
Northwest Normal University
Lanzhou, China
4 h-index
13 publications
240 citations
Lanzhou Jiaotong University
Lanzhou, China
4 h-index
12 publications
216 citations
Sobolev Institute of Mathematics
Novosibirsk, Russia
4 h-index
5 publications
88 citations
1–8 of 155
24 publications · 866 citations
17
h-index
11 publications · 382 citations
11
h-index
5 publications · 115 citations
5
h-index
5 publications · 254 citations
5
h-index
5 publications · 259 citations
5
h-index
1–5