The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs

Abstract

In this paper, a certain upper bound for the hamiltonian chromatic number of a connected graph is derived.

Keywords

• hamiltonian
• chromatic
• number
• connected
• graph
• without
• large
• hamiltonian-connected
• subgraphs