Chromatic equivalence of generalized ladder graphs

被引:0
|
作者
Guattery, S [1 ]
Haggard, G
Read, RC
机构
[1] Bucknell Univ, Lewisburg, PA 17837 USA
[2] Univ Waterloo, Waterloo, ON N2L 3G1, Canada
关键词
chromatic polynomial; chromatically equivalent graphs; ladder graphs; generalized ladder graphs;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for the chromatic polynomial of a graph of this type is proven. Finally, the chromatic polynomials of special cases of these graphs are explicitly computed.
引用
收藏
页码:33 / 44
页数:12
相关论文
共 50 条