The Mediator Chromatic Number of Grid Graphs

N. Roopesh, K. Thilagavathi · International Journal of Computer Applications · 2010

In this paper, we determine the mediator chromatic number of cartesian product of a path with and thus prove that the mediator chromatic number of Ladder graphs and Grid graphs are polynomially solvable.

Read the paper · More papers on PaperTik