Hamiltonian chromatic number of trees

Devsi Bantva, Samir Vaidya

Let $G$ be a simple finite connected graph of order $n$. The detour distance between two distinct vertices $u$ and $v$ denoted by $D(u,v)$ is the length of a longest $uv$-path in $…