【摘要】 对图G(V ,E) ,μ(G)称为G的Mycielskian的图 ,V(μ(G) ) =V(G) ∪ {v′｜v∈V(G) } ∪ {w}且w V(G) ,而E(μ(G) ) =E(G)∪ {uv′｜uv∈E(G) } ∪ {wv′｜v∈V(G) } .本文得到了完全图 μ(G)的边色数更多还原

【Abstract】 It is μ(G) called Mycielskian graphs G,if V (μ(G))=V(G)∪V′｝∪｛w｝ and wV(G) and E(μ(G))=E(G)∪｛uv′｜v′∈V′｝,where V′=｛v′∈V(G)｝.In this paper,we have studied the edge chroma tic number of complete graphs.更多还原