arXiv:1612.04194 Abstract | arXiv Analytics

arXiv:1612.04194 [math.GM]Abstract References Reviews Resources

A Note on Johan Colouring of Graphs

Published 2016-12-11Version 1

In this paper, a new type of colouring called Johan colouring is introduced. This colouring concept is motivated by the newly introduced invariant called the rainbow neighbourhood number of a graph. The study ponders on maximal colouring opposed to minimum colouring. An upperbound for a connected graph is presented and a number of explicit results are presented for cycles, complete graphs, wheel graphs and for a complete $l$-partite graph.

Comments: 6 pages, 5 figures, submitted

Categories: math.GM

Subjects: 05C15

Keywords: johan colouring, rainbow neighbourhood number, explicit results, study ponders, partite graph

Related articles:

arXiv:1704.02869 [math.GM] (Published 2017-04-03)

Johan Colouring of Graph Operations

Johan Kok, Sudev Naduvath

arXiv:1712.02324 [math.GM] (Published 2017-12-06)

On the Rainbow Neighbourhood Number of Set-Graphs

Johan Kok, Sudev Naduvath

arXiv:1703.01089 [math.GM] (Published 2017-03-03)