Chromaticity Of Bipartite Graphs With Three And Four Edges Deleted
Graphs are a set of vertices and edges. All vertices may or may not be joint. Vertex coloring is the coloring of a graph with a fixed number of colors such that adjacent vertices are of different colors. Graf adalah satu set titik dengan satu set garisan yang menghubungkan titik-titik. Semua t...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://eprints.usm.my/29571/1/Chromaticity_of_bipartite_graphs_with_three_and_four_edges_deleted.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
my-usm-ep.29571 |
|---|---|
| record_format |
uketd_dc |
| spelling |
my-usm-ep.295712015-12-08T08:03:55Z Chromaticity Of Bipartite Graphs With Three And Four Edges Deleted 2007-06 Yeang , Hoong Phoy QA1 Mathematics (General) Graphs are a set of vertices and edges. All vertices may or may not be joint. Vertex coloring is the coloring of a graph with a fixed number of colors such that adjacent vertices are of different colors. Graf adalah satu set titik dengan satu set garisan yang menghubungkan titik-titik. Semua titik mungkin dihubungkan dengan garisan. 2007-06 Thesis http://eprints.usm.my/29571/ http://eprints.usm.my/29571/1/Chromaticity_of_bipartite_graphs_with_three_and_four_edges_deleted.pdf application/pdf en public masters USM Pusat Pengajian Sains Matematik |
| institution |
Universiti Sains Malaysia |
| collection |
USM Institutional Repository |
| language |
English |
| topic |
QA1 Mathematics (General) |
| spellingShingle |
QA1 Mathematics (General) Yeang , Hoong Phoy Chromaticity Of Bipartite Graphs With Three And Four Edges Deleted |
| description |
Graphs are a set of vertices and edges. All vertices may or may not be joint. Vertex
coloring is the coloring of a graph with a fixed number of colors such that adjacent
vertices are of different colors.
Graf adalah satu set titik dengan satu set garisan yang menghubungkan titik-titik. Semua
titik mungkin dihubungkan dengan garisan. |
| format |
Thesis |
| qualification_level |
Master's degree |
| author |
Yeang , Hoong Phoy |
| author_facet |
Yeang , Hoong Phoy |
| author_sort |
Yeang , Hoong Phoy |
| title |
Chromaticity Of Bipartite Graphs With
Three And Four Edges Deleted |
| title_short |
Chromaticity Of Bipartite Graphs With
Three And Four Edges Deleted |
| title_full |
Chromaticity Of Bipartite Graphs With
Three And Four Edges Deleted |
| title_fullStr |
Chromaticity Of Bipartite Graphs With
Three And Four Edges Deleted |
| title_full_unstemmed |
Chromaticity Of Bipartite Graphs With
Three And Four Edges Deleted |
| title_sort |
chromaticity of bipartite graphs with
three and four edges deleted |
| granting_institution |
USM |
| granting_department |
Pusat Pengajian Sains Matematik |
| publishDate |
2007 |
| url |
http://eprints.usm.my/29571/1/Chromaticity_of_bipartite_graphs_with_three_and_four_edges_deleted.pdf |
| _version_ |
1747820167996375040 |