Perfect 3-colorings of the Johnson graphs J (4,2), J (5,2), J (6,2) and Petersen graph

Alaeiyan, MH; Abedi, A

Alaeiyan, MH (reprint author), Iran Univ Sci & Technol, Sch Comp Engn, Tehran 16844, Iran.

ARS COMBINATORIA, 2018; 140 (): 199

Abstract

A perfect m-coloring of a graph G with a matrix A = {a(ij)}(i,j) = (1), ... , (m) is a coloring of the vertices of G into the set of colors {1, ... , ......

Full Text Link