A Chromatic Metric on Graphs
In this chapter, we introduce the concept of relatedness of graphs, based upon the generalized chromatic number. This allows the definition of a graph metric. It is proved that the distance between any two graphs is at most three.
KeywordsGraphs Chromatic number Generalized graph coloring Graph distance Metric
Unable to display preview. Download preview PDF.
- 1.Benadé JG (1990) Some aspects of generalised graph colourings. Ph.D thesis, Department of Mathematics, Rand Afrikaans UniversityGoogle Scholar
- 2.Benadé G, Broere I (1988) Generalized colourings: existence of uniquely colourable graphs. Verslagreeks van die Departement Wiskunde, RAU, no. 6/88Google Scholar
- 6.Broere I, Frick M (1988) A characterization of the sequence of generalized chromatic numbers of a graph. In: Proceedings of the 6th international conference on the theory and applications of graphs, KalamazooGoogle Scholar
- 8.Brown JI (1987) A theory of generalized graph colouring. Ph.D. thesis, Department of Mathematics, University of TorontoGoogle Scholar
- 10.Burger M (1984) The cochromatic number of a graph. Ph.D. thesis, Department of Mathematics, Rand Afrikaans UniversityGoogle Scholar
- 11.Chartrand G, Geller DP (1968) On uniquely colorable planar graphs. J Combin Theory 6: 265–271Google Scholar
- 14.Frick M (1987) Generalised colourings of graphs. Ph.D thesis, Department of Mathematics, Rand Afrikaans UniversityGoogle Scholar
- 16.Harary F (1985) Conditional colorablility of graphs. In: Harary F, Maybee J (eds) Graphs and applications. Proc 1st Col Symp Graph theory. Wiley, New York, pp 127–136Google Scholar
- 18.Mynhardt CM, Broere I (1985) Generalized colorings of graphs. In: Alavi Y et al (eds) Graph theory and its applications to algorithms and computer science. Wiley, New York, pp 583–594Google Scholar