笛卡尔图的无圈边染色

Acyclic edge coloring of Cartesian graphs

研究图的结构时会发现,很多结构相对复染的图基本上是由一些结构简单的图通过笛卡尔积运算得到的,所以,可以根据笛卡尔积图的结构特征把两个简单图和进行笛卡尔积运算,其中|V(G)|=n,|V(H)|=m,可以把笛卡尔积图G×H分解成为m个不相交的G的拷贝和n个不相交的H的拷贝,用图分解法和染色构造法研究一些笛卡尔积图的无圈边染色包括路与圈、轮、扇的笛卡尔积图无圈边染色数.

Study the structure map will be found a lot of structure is relatively complex figure basically by some simple structure diagram by Descartes product operation, so we can according to the structural characteristics of Descartes product graphs, two simple graphs and Descartes integral, which we can put the Descartes product G - H is decomposed into disjoint copies of the M copy of the G and N disjoint H, using graph decomposition method and construction method of dyeing acyclic edge coloring of some Descartes product including Descartes road and ring, wheel, fan of the product graph acyclic edge chromatic number of dye.