Ladislav Nebesky, Univerzita Karlova v Praze, Filozoficka fakulta, nam. J. Palacha 2, 116 38 Praha 1, e-mail: Ladislav.Nebesky@ff.cuni.cz
Abstract: By a hamiltonian coloring of a connected graph $G$ of order $n \geq1$ we mean a mapping $c$ of $V(G)$ into the set of all positive integers such that $\vert c(x) - c(y)\vert\geq 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 \geq5$ with circumference $n - 2$.
Keywords: connected graphs, hamiltonian colorings, circumference
Classification (MSC 2000): 05C15, 05C38, 05C45, 05C78
Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).
Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade. To activate your access, please contact Myris Trade at myris@myris.cz.
