$K_{2n+1}$ That Are $(2n+1)$-Color $n$ Sequentially Hamiltonian

Vites Longani, Hatairat Yingtaweesittikul

Authors

  • Support Team

Keywords:

hamiltonian, complete graph

Abstract

It is known that $K_{2n+1}$ is the sum of n spanning cycles. We assign  colors  from $2n+1$ colors to each line of $K_{2n+1}$.   We find that, with some condition, it is possible to assign colors to  $K_{2n+1}$ such that each point is  adjacent  to $2n$ lines of different colors and each  of $n$ hamiltonian cycles has $2n+1$  lines of different colors.

Downloads

Published

2020-12-01

How to Cite

Team, S. (2020). $K_{2n+1}$ That Are $(2n+1)$-Color $n$ Sequentially Hamiltonian: Vites Longani, Hatairat Yingtaweesittikul. Thai Journal of Mathematics, 18(4), 1875–1880. Retrieved from https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/1109

Issue

Section

Articles