{"title":"色数在有界格数或有界交叉数图上的复杂度","authors":"W. Gasarch, N. Hayes, Anthony Ostuni, Davin Park","doi":"10.1145/3544979.3544987","DOIUrl":null,"url":null,"abstract":"e present a known theorem with the following authors. Part 1 was proven by Hopcroft and Tarjan [10]. Part 2 is easy. Part 3 was proven by Garey, Johnson, and Stockmeyer [6]. Part 4 was proven by Appel, Haken, and Koch [2, 3].","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Complexity of Chromatic Number When Restricted to graphs with Bounded Genus or Bounded Crossing Number\",\"authors\":\"W. Gasarch, N. Hayes, Anthony Ostuni, Davin Park\",\"doi\":\"10.1145/3544979.3544987\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"e present a known theorem with the following authors. Part 1 was proven by Hopcroft and Tarjan [10]. Part 2 is easy. Part 3 was proven by Garey, Johnson, and Stockmeyer [6]. Part 4 was proven by Appel, Haken, and Koch [2, 3].\",\"PeriodicalId\":387985,\"journal\":{\"name\":\"ACM SIGACT News\",\"volume\":\"5 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.3544987\",\"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.3544987","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
E与以下作者提出了一个已知定理。第1部分由Hopcroft和Tarjan[10]证明。第2部分很简单。第3部分得到了gary、Johnson和Stockmeyer的证明[6]。第4部分由Appel, Haken, and Koch证明[2,3]。
The Complexity of Chromatic Number When Restricted to graphs with Bounded Genus or Bounded Crossing Number
e present a known theorem with the following authors. Part 1 was proven by Hopcroft and Tarjan [10]. Part 2 is easy. Part 3 was proven by Garey, Johnson, and Stockmeyer [6]. Part 4 was proven by Appel, Haken, and Koch [2, 3].
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
