n Fynbedagte kleurespel in grafiekteorie/A clever colouring game in graph theory

In this study we focus on a generalised colouring of graphs, namely a metric chromatic colouring. We determine new upper bounds for the metric chromatic number of wheels and circulant graphs and show that these boundaries are an improvement on existing values.

Saved in:
Bibliographic Details
Published in:Suid-Afrikaanse tydskrif vir natuurwetenskap en tegnologie 2016-01, Vol.35 (1), p.1
Main Authors: Maritz, E C M, Dorfling, S, Vetrik, T
Format: Article
Language:Afrikaans
Subjects:
Graphs
Theory
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this study we focus on a generalised colouring of graphs, namely a metric chromatic colouring. We determine new upper bounds for the metric chromatic number of wheels and circulant graphs and show that these boundaries are an improvement on existing values.
ISSN:0254-3486
2222-4173
DOI:10.4102/satnt.v35i1.1420