On the edge chromatic number and adjacent strong edge chromatic number of sm sn 的边色数和邻强边色数
Edge disjoint - factors orthogonal to r disjoint subgraphs in mg k , mf k - graphs 系列平行图的邻强边色数
We also show strong edge chromatic number of two types of regular graphs with high degree and a note on a result of a . c . burris 给出了两类高度正则图的强边色数，并对a . c . burris的一个结果进行了初步的探讨。
In this thesis the relations among the parameters of hypergraphs and colourings of hypergraphs are discussed . this thesis consists of four chapters 本学位论文主要讨论超图中各参数间的关系以及超图的边色数问题，全文分4章。
We prove that halin graphs , 1 - trees and outerplanar graphs satisfy the conjecture presented by n . alon that the acyclic edge chromatic number of any graph does not exceed its maximum degree plus 2 证明了halin图、 1 -树和外平面图满足由n . alon提出的任何一个图的无圈边色数不超过其最大度加2的猜想。
Among them the applications with the general local lemma arc the most important , such as acyclic edge colorings of graphs . we prove that the acyclic edge chromatic number of g is less than or equal to a + 2 for any graph g whose girth is at least 700 log ) sz局部引理给出应用实例，即无圈边染色，证明了当图g的围长大于等于700 log时，图g的无圈边色教小于等于+ 2然后，用概率论的方法证明了几种形式的lov (
