{"title":"开放性问题专栏","authors":"W. Gasarch","doi":"10.1145/3544979.3544985","DOIUrl":null,"url":null,"abstract":"This issue's Open Problem Column is by William Gasarch, Nathan Hayes, Anthony Ostuni, and Davin Park. It is The complexity of chromatic number when restricted to graphs with either bounded genus or bounded crossing number.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Open Problems Column\",\"authors\":\"W. Gasarch\",\"doi\":\"10.1145/3544979.3544985\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This issue's Open Problem Column is by William Gasarch, Nathan Hayes, Anthony Ostuni, and Davin Park. It is The complexity of chromatic number when restricted to graphs with either bounded genus or bounded crossing number.\",\"PeriodicalId\":387985,\"journal\":{\"name\":\"ACM SIGACT News\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SIGACT News\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3544979.3544985\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3544979.3544985","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本期开放问题专栏由William Gasarch, Nathan Hayes, Anthony Ostuni和Davin Park撰写。本文讨论了色数在有界格数和有界交叉数图上的复杂性。
This issue's Open Problem Column is by William Gasarch, Nathan Hayes, Anthony Ostuni, and Davin Park. It is The complexity of chromatic number when restricted to graphs with either bounded genus or bounded crossing number.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
