n个图的逻辑积的色数和边色数

The Chromatic Number and Edge Chromatic Number of Conjunction of n Graphs

证明了图的逻辑积的色数公式ｘ（Ｇ１∧Ｇ２∧…∧Ｇｎ）≤ｍｉｎ｛ｘ（Ｇ１），ｘ（Ｇ２），…，ｘ（Ｇｎ）｝，边色数有并作如下猜想：ｘ（Ｇ１∧Ｇ２∧…∧Ｇｎ）＝ｍｉｎ｛ｘ（Ｇ１），ｘ（Ｇ２），…，ｘ（Ｇｎ）｝．

The chromatic number of conjunction of n graphs is x(G1∧G2∧…∧Gn)≤ min {x(G1), x(G2),…,x(Gn)}, and the edge chromatic number have are proved. A conjecture is given in the following: x(G1 ∧G2∧…∧Gn)= min {x(G1),x(G2),…,x(Gn)}.