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...
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | थीसिस |
| भाषा: | अंग्रेज़ी |
| प्रकाशित: |
2009
|
| विषय: | |
| ऑनलाइन पहुंच: | http://eprints.usm.my/42396/ |
| सारांश: | 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 been discovered and
many families of such graphs have been obtained. The purpose of this thesis is to
contribute new results on the chromatic equivalence and chromatic uniqueness
of graphs, specifically, K4-homeomorphs. |
|---|