This paper intends to study the relation between PRN and chromatic number of planar graphs. In this regard we investigate that isomorphic or 1 isomorphic graph may or may not have equal PRN and few other related results. Precisely, we give simple proof of Four Color Map Theorem.

Periodical:

The Bulletin of Society for Mathematical Services and Standards (Volume 11)

Pages:

26-30

DOI:

10.18052/www.scipress.com/BSMaSS.11.26

Citation:

H.R. Bhapkar and J.N. Salunke, "Proof of Four Color Map Theorem by Using PRN of Graph", The Bulletin of Society for Mathematical Services and Standards, Vol. 11, pp. 26-30, 2014

Online since:

Sep 2014

Authors:

Keywords:

Distribution:

Open Access

This work is licensed under a

Creative Commons Attribution 4.0 International License