Chromaticity Of Certain K4-Homeomorphs
The chromaticity of graphs is the term used referring to the question of chromatic equivalence and chromatic uniqueness of graphs. Since the arousal of the interest on the chromatically equivalent and chromatically unique graphs, various concepts and results under the said areas of research have...
Saved in:
Main Author: | Ghimire, Sabina Catada |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | http://eprints.usm.my/42396/1/Sabina_Catada_Ghimire24.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Chromaticity of K4-Homeomorphs with Girth 9 and 6-Bridge Graphs (IR)
by: Nor Suriya Abd Karim
Published: (2007) -
Chromaticity Of Bipartite Graphs With
Three And Four Edges Deleted
by: Yeang , Hoong Phoy
Published: (2007) -
Chromaticity of Certain Bipartite Graphs
by: Hasni @ Abdullah, Roslan
Published: (2005) -
Chromatic Equivalence Classes and Chromatic Defining Numbers of Certain Graphs
by: Omoomi, Behnaz
Published: (2001) -
Saddlepoint Approximation To Certain
Cumulative Distribution Functions
by: Omar, Almutairi Alya
Published: (2015)