A family of chromatically unique 5-bridge graphs

作者：Li Xue Feng^*

来源：Ars Combinatoria, 2008, 88: 415-428.

• generalized polygon tree
• 5-bridge graphs
• chromatically equivalent
• chromatically unique

Let P(G; lambda) denote the chromatic polynomial of a graph G, expressed in the variable lambda. Then G is said to be chromatically unique if G is isomorphic with H for any graph H such that P(H; lambda) = P(G; lambda). The graph consisting of s edge-disjoint paths joining two vertices is called an s-bridge graph. In this paper, we provide a new family of chromatically unique 5-bridge graphs.

• 出版日期2008-7
• 单位西安邮电大学