On a Lovász-type lemma, applied to Brooks’ theorem for list-colouring期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

On a Lovász-type lemma, applied to Brooks’ theorem for list-colouring

Authors:	Helge Tverberg

Affiliation:	^aDepartment of Mathematics, UiB, Johs. Bruns gate 12, 5008 Bergen, Norway

Abstract:	In this paper, I present a new structural lemma for k-regular graphs, similar to an earlier lemma by Lovász (1975) [5]. The new lemma is then used to give an algebraic proof of Brooks’ theorem for list-colouring.

Keywords:	stixSupport" id=" mmlsi2" > inlMMLBox" > submitCitation('/science?_ob=MathURL& _method=retrieve& _eid=1-s2.0-S0012365X1100238X& _mathId=si2.gif& _pii=S0012365X1100238X& _issn=0012365X& _acct=C000069490& _version=1& _userid=6211566& md5=dba5b8871b3bd793dee9df1ea8ec623e')" style=" cursor:pointer " > click to view the MathML source" >k-regular graphs Graph colouring List-colouring Brooks&rsquo theorem
本文献已被 ScienceDirect 等数据库收录！