scholarly journals A classification of graphs of diameter $2$

2020 ◽  
Vol 17 ◽  
pp. 502-512
Author(s):  
T. I. Fedoryaeva
2012 ◽  
Vol 29 (1-2) ◽  
pp. 65-80 ◽  
Author(s):  
Miriam Schmidt ◽  
Günther Palm ◽  
Friedhelm Schwenker

1989 ◽  
Vol 576 (1 Graph Theory) ◽  
pp. 328-335 ◽  
Author(s):  
NIAN-ZU LI ◽  
EARL GLEN WHITEHEAD

1990 ◽  
Vol 22 (5) ◽  
pp. 417-421 ◽  
Author(s):  
R. Ayala ◽  
E. Dominguez ◽  
A. Marquez ◽  
A. Quintero

Author(s):  
Faraz Dadgostari ◽  
Mahtab Hosseininia

In this chapter a particular type of graph labeling, called graph coloring, is introduced and discussed. In the first part, the simple type of coloring, vertex coloring, is focused. Thus, concerning vertex coloring, some terms and definitions are introduced. Next, some theorems and applying those theorems, some coloring algorithms and applications are introduced. At last, some helpful concepts such as critical graphs, list coloring, and vertex decomposition are presented and discussed. In the second section, edge coloring is focused. Thus, concerning edge coloring, some terms and definitions are described, some important information about edge chromatic number and edge list coloring is presented, and applying them, classification of graphs using the coloring approach is summarized. At last some helpful concepts such as edge list coloring and edge decomposition are illustrated and discussed.


Sign in / Sign up

Export Citation Format

Share Document