{"title":"关于完全着色的强制周期性","authors":"Pyry Herva, J. Kari","doi":"10.1007/s00224-023-10127-x","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":"67 1","pages":"732 - 759"},"PeriodicalIF":0.6000,"publicationDate":"2023-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Forced Periodicity of Perfect Colorings\",\"authors\":\"Pyry Herva, J. Kari\",\"doi\":\"10.1007/s00224-023-10127-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":22832,\"journal\":{\"name\":\"Theory of Computing Systems\",\"volume\":\"67 1\",\"pages\":\"732 - 759\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-01-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theory of Computing Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00224-023-10127-x\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theory of Computing Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00224-023-10127-x","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
期刊介绍:
TOCS is devoted to publishing original research from all areas of theoretical computer science, ranging from foundational areas such as computational complexity, to fundamental areas such as algorithms and data structures, to focused areas such as parallel and distributed algorithms and architectures.