Hamiltonian colorings of graphs with long cycles

Nebeský, Ladislav. "Hamiltonian colorings of graphs with long cycles." Mathematica Bohemica 128.3 (2003): 263-275. <http://eudml.org/doc/249233>.

@article{Nebeský2003,
abstract = {By a hamiltonian coloring of a connected graph $G$ of order $n \ge 1$ we mean a mapping $c$ of $V(G)$ into the set of all positive integers such that $\vert c(x) - c(y)\vert \ge n - 1 - D_G(x, y)$ (where $D_G(x, y)$ denotes the length of a longest $x-y$ path in $G$) for all distinct $x, y \in G$. In this paper we study hamiltonian colorings of non-hamiltonian connected graphs with long cycles, mainly of connected graphs of order $n \ge 5$ with circumference $n - 2$.},
author = {Nebeský, Ladislav},
journal = {Mathematica Bohemica},
keywords = {connected graphs; hamiltonian colorings; circumference; connected graphs; hamiltonian colorings; circumference},
language = {eng},
number = {3},
pages = {263-275},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Hamiltonian colorings of graphs with long cycles},
url = {http://eudml.org/doc/249233},
volume = {128},
year = {2003},
}

TY - JOUR
AU - Nebeský, Ladislav
TI - Hamiltonian colorings of graphs with long cycles
JO - Mathematica Bohemica
PY - 2003
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 128
IS - 3
SP - 263
EP - 275
AB - By a hamiltonian coloring of a connected graph $G$ of order $n \ge 1$ we mean a mapping $c$ of $V(G)$ into the set of all positive integers such that $\vert c(x) - c(y)\vert \ge n - 1 - D_G(x, y)$ (where $D_G(x, y)$ denotes the length of a longest $x-y$ path in $G$) for all distinct $x, y \in G$. In this paper we study hamiltonian colorings of non-hamiltonian connected graphs with long cycles, mainly of connected graphs of order $n \ge 5$ with circumference $n - 2$.
LA - eng
KW - connected graphs; hamiltonian colorings; circumference; connected graphs; hamiltonian colorings; circumference
UR - http://eudml.org/doc/249233
ER -