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:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | en English |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://psasir.upm.edu.my/id/eprint/64/1/1000548936_fsas_2005_2.pdf http://psasir.upm.edu.my/id/eprint/64/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832509489374298112 |
|---|---|
| author | Hasni @ Abdullah, Roslan |
| author_facet | Hasni @ Abdullah, Roslan |
| author_sort | Hasni @ Abdullah, Roslan |
| building | UPM Library |
| collection | Institutional Repository |
| content_provider | Universiti Putra Malaysia |
| content_source | UPM Institutional Repository |
| continent | Asia |
| country | Malaysia |
| 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 |
| id | my.upm.eprints-64 |
| institution | Universiti Putra Malaysia |
| language | en English |
| publishDate | 2005 |
| record_format | eprints |
| spelling | my.upm.eprints-642013-05-27T06:45:24Z http://psasir.upm.edu.my/id/eprint/64/ Chromaticity of Certain Bipartite Graphs 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). 2005-01 Thesis NonPeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/64/1/1000548936_fsas_2005_2.pdf Hasni @ Abdullah, Roslan (2005) Chromaticity of Certain Bipartite Graphs. PhD thesis, Universiti Putra Malaysia. Bipartite graphs Graph coloring English |
| spellingShingle | Bipartite graphs Graph coloring Hasni @ Abdullah, Roslan Chromaticity of Certain Bipartite Graphs |
| title | 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_short | Chromaticity of Certain Bipartite Graphs |
| title_sort | chromaticity of certain bipartite graphs |
| topic | Bipartite graphs Graph coloring |
| url | http://psasir.upm.edu.my/id/eprint/64/1/1000548936_fsas_2005_2.pdf http://psasir.upm.edu.my/id/eprint/64/ |
| url_provider | http://psasir.upm.edu.my/ |