Hamiltonian Partition Coloring

Mudartha Kulrekha, R Sundareswaran, V Swaminathan


The hamiltonian coloring of a connected graph $G$ introduced by Chartrand et al \cite {ch} is different from hamiltonian partition coloring. In this paper, we characterize graphs which has a hamiltonian partition. Also, we give example of graphs having prescribed chromatic numbers and hamiltonian partition numbers. We derive results connecting the hamiltonian chromatic number of $G_1 \cup G_2$ and $G_1 + G_2$.

Full Text:



  • There are currently no refbacks.

Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.