Chromatic Equivalence of Generalized Ladder Graphs

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. Key Words: chromatic polynomial, chromatically equivalent graphs, ladder graphs, generalized ladder graphs

• Type: Journal
• Year: 2005
• Where: ARSCOM
• Authors: Stephen Guattery, Gary Haggard, Ronald C. Read
• Keywords: ARSCOM 2005, Chromatic Polynomial, Ladder Graphs, Sufficient Condition