{"title":"图的中心折叠与其色数的关系","authors":"H. Rafat","doi":"10.4172/2168-9679.1000378","DOIUrl":null,"url":null,"abstract":"Coloring graph is a good branch in graph theory and has a lot of application in our life. So, in this paper we have defined a new type of folding. Also, we have found strong relations between this folding of graph and its chromatic number. Theorems governing the relations to be obtained. Traffic lights problem here was solved.","PeriodicalId":15007,"journal":{"name":"Journal of Applied and Computational Mathematics","volume":"42 1","pages":"1-3"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Relation between Centre Folding of Graph and its Chromatic Number\",\"authors\":\"H. Rafat\",\"doi\":\"10.4172/2168-9679.1000378\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Coloring graph is a good branch in graph theory and has a lot of application in our life. So, in this paper we have defined a new type of folding. Also, we have found strong relations between this folding of graph and its chromatic number. Theorems governing the relations to be obtained. Traffic lights problem here was solved.\",\"PeriodicalId\":15007,\"journal\":{\"name\":\"Journal of Applied and Computational Mathematics\",\"volume\":\"42 1\",\"pages\":\"1-3\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied and Computational Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4172/2168-9679.1000378\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Computational Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4172/2168-9679.1000378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Relation between Centre Folding of Graph and its Chromatic Number
Coloring graph is a good branch in graph theory and has a lot of application in our life. So, in this paper we have defined a new type of folding. Also, we have found strong relations between this folding of graph and its chromatic number. Theorems governing the relations to be obtained. Traffic lights problem here was solved.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
