Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
