{"title":"New proof of brooks' theorem","authors":"L.S. Melnikov, V.G. Vizing","doi":"10.1016/S0021-9800(69)80057-8","DOIUrl":null,"url":null,"abstract":"<div><p>The new proof is shorter than the original one [1] and emphasizes the important role of recoloring of two-color chains in questions related to chromatic number of graphs.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 4","pages":"Pages 289-290"},"PeriodicalIF":0.0000,"publicationDate":"1969-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80057-8","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980069800578","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17
Abstract
The new proof is shorter than the original one [1] and emphasizes the important role of recoloring of two-color chains in questions related to chromatic number of graphs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
