An Essay on Compônentă Analysis of Graphs
Johan Kok, Sudev Naduvath · arXiv (Cornell University) · 2017
In most studies related to colouring of graphs and perhaps in the study of other invariants and variants of graphs, the restrictions of non-triviality and connectedness are placed upon graphs. For the introduction to compônentă analysis, these restrictions are relaxed. In particular, this essay focuses on compônentă analysis in respect of the recently introduced $J$-colouring. The concept of $J^c$-rainbow connectivity is also introduced in this paper.