三圈图的(2,2)-可选性的证明

Proof of(2,2)-Choosability of Tricyclic Graphs

每一个图是(2,2)-可选的猜想迄今未被解决,为了推动(2,2)-可选猜想的证明,利用积和指数的方法证明了所有三圈图是(2,2)-可选的。

The conjecture that every graph is(2,2)-choosability has so far not been solved.To push(2,2)-choosability proof,the method of permanent index was used to show that all tricyclic graphs are(2,2)-choosability.