K. Das, Samane Bakaein, M. Tavakoli, F. Rahbarnia, A. Ashrafi
{"title":"某些图运算下的列表着色","authors":"K. Das, Samane Bakaein, M. Tavakoli, F. Rahbarnia, A. Ashrafi","doi":"10.46793/kgjmat2203.417d","DOIUrl":null,"url":null,"abstract":"The list coloring of a graph G = G(V, E) is to color each vertex v ∈ V (G) from its color set L(v). If any two adjacent vertices have different colors, then G is properly colored. The aim of this paper is to study the list coloring of some graph operations","PeriodicalId":44902,"journal":{"name":"Kragujevac Journal of Mathematics","volume":" ","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"List Coloring Under Some Graph Operations\",\"authors\":\"K. Das, Samane Bakaein, M. Tavakoli, F. Rahbarnia, A. Ashrafi\",\"doi\":\"10.46793/kgjmat2203.417d\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The list coloring of a graph G = G(V, E) is to color each vertex v ∈ V (G) from its color set L(v). If any two adjacent vertices have different colors, then G is properly colored. The aim of this paper is to study the list coloring of some graph operations\",\"PeriodicalId\":44902,\"journal\":{\"name\":\"Kragujevac Journal of Mathematics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Kragujevac Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46793/kgjmat2203.417d\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kragujevac Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46793/kgjmat2203.417d","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
The list coloring of a graph G = G(V, E) is to color each vertex v ∈ V (G) from its color set L(v). If any two adjacent vertices have different colors, then G is properly colored. The aim of this paper is to study the list coloring of some graph operations
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
