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...

Full description

Saved in:

Bibliographic Details
Main Author:	Hasni @ Abdullah, Roslan
Format:	Thesis
Language:	English English
Published:	2005
Subjects:	Bipartite graphs Graph coloring
Online Access:	http://psasir.upm.edu.my/id/eprint/64/1/1000548936_fsas_2005_2.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-upm-ir.64
record_format	uketd_dc
spelling	my-upm-ir.642013-05-27T06:45:24Z Chromaticity of Certain Bipartite Graphs 2005-01 Hasni @ Abdullah, Roslan 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). Bipartite graphs Graph coloring 2005-01 Thesis http://psasir.upm.edu.my/id/eprint/64/ http://psasir.upm.edu.my/id/eprint/64/1/1000548936_fsas_2005_2.pdf application/pdf en public phd doctoral Universiti Putra Malaysia Bipartite graphs Graph coloring Faculty of Science and Environmental Studies English
institution	Universiti Putra Malaysia
collection	PSAS Institutional Repository
language	English English
topic	Bipartite graphs Graph coloring
spellingShingle	Bipartite graphs Graph coloring Hasni @ Abdullah, Roslan Chromaticity of Certain Bipartite Graphs
description	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).
format	Thesis
qualification_name	Doctor of Philosophy (PhD.)
qualification_level	Doctorate
author	Hasni @ Abdullah, Roslan
author_facet	Hasni @ Abdullah, Roslan
author_sort	Hasni @ Abdullah, Roslan
title	Chromaticity of Certain Bipartite Graphs
title_short	Chromaticity of Certain Bipartite Graphs
title_full	Chromaticity of Certain Bipartite Graphs
title_fullStr	Chromaticity of Certain Bipartite Graphs
title_full_unstemmed	Chromaticity of Certain Bipartite Graphs
title_sort	chromaticity of certain bipartite graphs
granting_institution	Universiti Putra Malaysia
granting_department	Faculty of Science and Environmental Studies
publishDate	2005
url	http://psasir.upm.edu.my/id/eprint/64/1/1000548936_fsas_2005_2.pdf
_version_	1747810158979842048

Chromaticity of Certain Bipartite Graphs

Similar Items