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