Mbius梯的着色问题

The Coloring Problem of Mbius Ladder

色多项式是图论的重要研究内容之一.借助广义Pólya定理和一些代数方法,讨论了特殊图类Mbius梯在不同约束条件下的着色问题,分别给出色多项式的不同表达式.

The chromatic polynomials of graphs are important parts of graph theory.In this paper,we discuss the coloring problem of special graph M？bius Ladder under different constraints by means of gener-alized P＆#243;lya theorem and some algebraic methods and also give the different chromatic polynomial.