Chromaticity of K4-Homeomorphs with Girth 9 and 6-Bridge Graphs (IR)
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 bee...
Saved in:
Main Author: | Nor Suriya Abd Karim |
---|---|
Format: | thesis |
Language: | eng |
Published: |
2007
|
Subjects: | |
Online Access: | https://ir.upsi.edu.my/detailsg.php?det=828 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Chromaticity Of Certain K4-Homeomorphs
by: Ghimire, Sabina Catada
Published: (2009) -
On graphs determined by their chromatic polynomials /
by: Ho, Chee Kit
Published: (2004) -
Chromaticity Of Bipartite Graphs With
Three And Four Edges Deleted
by: Yeang , Hoong Phoy
Published: (2007) -
Structures and chromaticity of graphs /
by: Dong, Feng Ming
Published: (1997) -
On chromatic polynomials of graphs /
by: Ho, Chee Kit
Published: (1998)