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: | Yeang , Hoong Phoy |
---|---|
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!
|
Similar Items
-
Chromaticity of Certain Bipartite Graphs
by: Hasni @ Abdullah, Roslan
Published: (2005) -
Chromaticity Of Certain K4-Homeomorphs
by: Ghimire, Sabina Catada
Published: (2009) -
Chromaticity of K4-Homeomorphs with Girth 9 and 6-Bridge Graphs (IR)
by: Nor Suriya Abd Karim
Published: (2007) -
On graphs determined by their chromatic polynomials /
by: Ho, Chee Kit
Published: (2004) -
Structures and chromaticity of graphs /
by: Dong, Feng Ming
Published: (1997)