{"title":"用图的PRN证明四色映射定理","authors":"H. Bhapkar, J. N. Salunke","doi":"10.18052/WWW.SCIPRESS.COM/BSMASS.11.26","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Proof of Four Color Map Theorem by Using PRN of Graph\",\"authors\":\"H. Bhapkar, J. N. Salunke\",\"doi\":\"10.18052/WWW.SCIPRESS.COM/BSMASS.11.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":252632,\"journal\":{\"name\":\"Bulletin of Mathematical Sciences and Applications\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of Mathematical Sciences and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18052/WWW.SCIPRESS.COM/BSMASS.11.26\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of Mathematical Sciences and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BSMASS.11.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Proof of Four Color Map Theorem by Using PRN of Graph
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
