Hamiltonian chromatic number of block graphs

by   Devsi Bantva, et al.

Let G be a simple connected graph of order n. A hamiltonian coloring c of a graph G is an assignment of colors (non-negative integers) to the vertices of G such that D(u, v) + |c(u) - c(v)| ≥ n - 1 for every two distinct vertices u and v of G, where D(u, v) denotes the detour distance between u and v in G which is the length of the longest path between u and v. The value hc(c) of a hamiltonian coloring c is the maximum color assigned to a vertex of G. The hamiltonian chromatic number, denoted by hc(G), is min{hc(c)} taken over all hamiltonian coloring c of G. In this paper, we give a necessary and sufficient condition to achieve a lower bound for the hamiltonian chromatic number of block graphs given in [Theorem 1,On Hamiltonian Colorings of Block graphs, In: Kaykobad, M., Petrechi, R., (eds.) WALCOM: Algorithms and Computation, LNCS: 9627, 28-39, 2016]. We present an algorithm for optimal hamiltonian coloring of a special class of block graphs, namely SDB(p/2) block graphs. We characterize level-wise regular block graphs and extended star of blocks achieving this lower bound.


page 1

page 2

page 3

page 4


Hamiltonian chromatic number of trees

Let G be a simple finite connected graph of order n. The detour distance...

More relations between λ-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs

This paper deals with the λ-labeling and L(2,1)-coloring of simple graph...

3-Coloring on Regular, Planar, and Ordered Hamiltonian Graphs

We prove that 3-Coloring remains NP-hard on 4- and 5-regular planar Hami...

Optimal Radio Labellings of Block Graphs and Line Graphs of Trees

A radio labeling of a graph G is a mapping f : V(G) →{0, 1, 2,...} such ...

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs

An equitable coloring of a graph G=(V,E) is a (proper) vertex-coloring o...

Local WL Invariance and Hidden Shades of Regularity

The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a powerful tool f...

Embedding Irregular Colorings into Connected Factorizations

For r:=(r_1,…,r_k), an r-factorization of the complete λ-fold h-uniform ...

Please sign up or login with your details

Forgot password? Click here to reset