Chromaticity of Certain Bipartite Graphs

Since the introduction of the concepts of chromatically unique graphs and chromatically equivalent graphs, numerous families of such graphs have been obtained. The purpose of this thesis is to continue with the search of families of chromatically unique bipartite graphs. In Chapters 1 and 2, we...

全面介绍

Saved in:
书目详细资料
主要作者: Hasni @ Abdullah, Roslan
格式: Thesis
语言:English
English
出版: 2005
主题:
在线阅读:http://psasir.upm.edu.my/id/eprint/64/1/1000548936_fsas_2005_2.pdf
标签: 添加标签
没有标签, 成为第一个标记此记录!
实物特征
总结:Since the introduction of the concepts of chromatically unique graphs and chromatically equivalent graphs, numerous families of such graphs have been obtained. The purpose of this thesis is to continue with the search of families of chromatically unique bipartite graphs. In Chapters 1 and 2, we define the concept of graph colouring, the associated chromatic polynomial and some properties of a chromatic polynomial. We also give some necessary conditions for graphs that are chromatically unique or chromatically equivalent. We end this chapter by stating some known results on the chromaticity of bipartite graphs, denoted as K(p,q).