# Hamiltonian coloring

Hamiltonian coloring is a type of graph coloring. Hamiltonian coloring uses a concept called detour distance between two vertices of the graph. It…
Wikipedia (opens in a new tab)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
• D. Bantva
• J. Graph Algorithms Appl.
• 2019
• Corpus ID: 16784185
Let $G$ be a simple connected graph of order $n$. A hamiltonian coloring $c$ of a graph $G$ is an assignment of colors (non…
2016
2016
• D. Bantva
• International Conference on Algorithms and…
• 2016
• Corpus ID: 36843302
A hamiltonian coloringc of a graph G of order n is a mapping c : $$VG \rightarrow \{0,1,2,...\}$$ such that Du,i¾źv + |cu - cv…
2012
2012
• Discussiones Mathematicae Graph Theory
• 2012
• Corpus ID: 26560540
For a strong oriented graph D of order n and diameter d and an integer k with 1 ≤ k ≤ d, the kth power D k of D is that digraph…
2008
2008
• Discrete Applied Mathematics
• 2008
• Corpus ID: 45500058
2005
2005
• Discrete Mathematics
• 2005
• Corpus ID: 207130615
2003
2003
By a hamiltonian coloring of a connected graph G of order n > 1 we mean a mapping c of V (G) into the set of all positive…