{"title":"关于顶点图的可选择性","authors":"W. Charoenpanitseri","doi":"10.1155/2015/690517","DOIUrl":null,"url":null,"abstract":"A -list assignment of a graph is a mapping which assigns a set of size to each vertex of and . A graph is -choosable if has a proper coloring such that for each -list assignment . In 2011, Charoenpanitseri et al. gave a characterization of -choosability of -vertex graphs when and left open problems when . Recently, Ruksasakchai and Nakprasit obtain the results when . In this paper, we extend the results to case .","PeriodicalId":39893,"journal":{"name":"INTERNATIONAL JOURNAL OF MATHEMATICS AND MATHEMATICAL SCIENCES","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2015-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1155/2015/690517","citationCount":"1","resultStr":"{\"title\":\"On -Choosability of -Vertex Graphs\",\"authors\":\"W. Charoenpanitseri\",\"doi\":\"10.1155/2015/690517\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A -list assignment of a graph is a mapping which assigns a set of size to each vertex of and . A graph is -choosable if has a proper coloring such that for each -list assignment . In 2011, Charoenpanitseri et al. gave a characterization of -choosability of -vertex graphs when and left open problems when . Recently, Ruksasakchai and Nakprasit obtain the results when . In this paper, we extend the results to case .\",\"PeriodicalId\":39893,\"journal\":{\"name\":\"INTERNATIONAL JOURNAL OF MATHEMATICS AND MATHEMATICAL SCIENCES\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2015-05-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1155/2015/690517\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"INTERNATIONAL JOURNAL OF MATHEMATICS AND MATHEMATICAL SCIENCES\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1155/2015/690517\",\"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":"INTERNATIONAL JOURNAL OF MATHEMATICS AND MATHEMATICAL SCIENCES","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2015/690517","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1
摘要
图的-list赋值是一种映射,它为和的每个顶点赋值一个大小集合。图是可选择的,如果有一个适当的着色,使每个-list分配。Charoenpanitseri et al.在2011年给出了顶点图的-可选择性的表征,并在时留下了开放问题。最近,Ruksasakchai和Nakprasit获得了结果。在本文中,我们将结果推广到实例。
A -list assignment of a graph is a mapping which assigns a set of size to each vertex of and . A graph is -choosable if has a proper coloring such that for each -list assignment . In 2011, Charoenpanitseri et al. gave a characterization of -choosability of -vertex graphs when and left open problems when . Recently, Ruksasakchai and Nakprasit obtain the results when . In this paper, we extend the results to case .
期刊介绍:
The International Journal of Mathematics and Mathematical Sciences is a refereed math journal devoted to publication of original research articles, research notes, and review articles, with emphasis on contributions to unsolved problems and open questions in mathematics and mathematical sciences. All areas listed on the cover of Mathematical Reviews, such as pure and applied mathematics, mathematical physics, theoretical mechanics, probability and mathematical statistics, and theoretical biology, are included within the scope of the International Journal of Mathematics and Mathematical Sciences.