摘要
图Ｇ的非正常边着色，即（ｍ·ｄ）一边着色是把边集Ｅ（Ｇ）划分成ｍ个子集Ｅ１，Ｅ２，…，Ｅｍ，使得每一边子集的导出子图Ｇ〔Ｅｉ〕，ｉ＝１，２，…，ｍ的最大度最多是ｄ。Ｗｏｏｄａｌ问：对奇数ｄ和自然数ｍ，最大度是ｍｄ的第二类图中哪些是（ｍｄ）一边可着色的？哪些不是？本文对Ｗｏｏｄａｌ的这一公开问题给出了一些明确的解答。
An improper edge-colouring of G,i.e.,(m,d)-edge-colouring of G,is a partition of its edges into m subsets,E1,E2,…,Em,each of which induces a subgraph with maximum degree at most d.Woodall asked:for each odd integer d and each m,which graphs of class two with maximum degree md are (m.d)-edge-colourable and which are not?This paper gives some explicit solutions to Woodall's problem known to the public.
出处
《山东矿业学院学报》
CAS
1997年第4期432-435,共4页
Journal of Shandong University of Science and Technology(Natural Science)
