Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

3 relations
Graph coloringPath (graph theory)Vertex (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Hamiltonian chromatic number of block graphs
  • D. Bantva
  • J. Graph Algorithms Appl.
  • 2017
  • 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
On Hamiltonian Colorings of Trees
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… 
2016
2016
On Hamiltonian Colorings of Block Graphs
A hamiltonian coloring c of a graph G of order p is an assignment of colors to the vertices of G such that D(u, v) + \(|c(u) - c… 
2012
2012
Hamiltonian-colored powers of strong digraphs
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… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2008
2008
On hamiltonian colorings for some graphs
2005
2005
On hamiltonian colorings of graphs
  • figure 1
2003
2003
Hamiltonian colorings of graphs with long cycles
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… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE