{"title":"犹豫模糊图着色","authors":"A. Prasanna, M. A. Rifayathali, S. Mohideen","doi":"10.22457/ijfma.v14n2a2","DOIUrl":null,"url":null,"abstract":"Graph coloring dates back to 1852, when Francis Guthrie come up with the four color conjecture. Gary Chartrand and Ping Zhang [3] discussed various colorings of graph and its properties in their book entitled Chromatic Graph Theory. A graph coloring is the assignment of a color to each of the vertices or edges or both in such a way that no two adjacent vertices and incident edges share the same color. Graph coloring has been applied to many real world problems like scheduling, allocation, telecommunications and bioinformatics, etc.","PeriodicalId":385922,"journal":{"name":"International Journal of Fuzzy Mathematical Archive","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Hesitancy Fuzzy Graph Coloring\",\"authors\":\"A. Prasanna, M. A. Rifayathali, S. Mohideen\",\"doi\":\"10.22457/ijfma.v14n2a2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph coloring dates back to 1852, when Francis Guthrie come up with the four color conjecture. Gary Chartrand and Ping Zhang [3] discussed various colorings of graph and its properties in their book entitled Chromatic Graph Theory. A graph coloring is the assignment of a color to each of the vertices or edges or both in such a way that no two adjacent vertices and incident edges share the same color. Graph coloring has been applied to many real world problems like scheduling, allocation, telecommunications and bioinformatics, etc.\",\"PeriodicalId\":385922,\"journal\":{\"name\":\"International Journal of Fuzzy Mathematical Archive\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Fuzzy Mathematical Archive\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22457/ijfma.v14n2a2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Fuzzy Mathematical Archive","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22457/ijfma.v14n2a2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Graph coloring dates back to 1852, when Francis Guthrie come up with the four color conjecture. Gary Chartrand and Ping Zhang [3] discussed various colorings of graph and its properties in their book entitled Chromatic Graph Theory. A graph coloring is the assignment of a color to each of the vertices or edges or both in such a way that no two adjacent vertices and incident edges share the same color. Graph coloring has been applied to many real world problems like scheduling, allocation, telecommunications and bioinformatics, etc.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
