Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 219,937,502 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Graph coloring
Path (graph theory)
Vertex (graph theory)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Hamiltonian chromatic number of block graphs
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…
Expand
2012
2012
Hamiltonian-colored powers of strong digraphs
Garry L. Johns
,
Ryan C. Jones
,
Kyle Kolasinski
,
Ping Zhang
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…
Expand
2005
2005
On hamiltonian colorings of graphs
G. Chartrand
,
L. Nebeský
,
Ping Zhang
Discrete Mathematics
2005
Corpus ID: 207130615
2003
2003
Hamiltonian colorings of graphs with long cycles
L. Nebeský
2003
Corpus ID: 31796425
. 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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE