Hamiltonian colorings of graphs with long cycles

Title:

Hamiltonian colorings of graphs with long cycles

Creator:

Nebeský, Ladislav

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:043b65a1-6868-4feb-93e0-f65f4c90a753
uuid:043b65a1-6868-4feb-93e0-f65f4c90a753
doi:10.21136/MB.2003.134180

Subject:

connected graphs, hamiltonian colorings, and circumference

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

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 integers such that |c(x) − c(y)| ≥ n − 1 − DG(x, y) (where DG(x, y) denotes the length of a longest x − y path in G) for all distinct x, y ∈ G. In this paper we study hamiltonian colorings of non-hamiltonian connected graphs with long cycles, mainly of connected graphs of order n ≥ 5 with circumference n − 2.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

263-275

Source:

Mathematica bohemica | 2003 Volume:128 | Number:3

Harvested from:

CDK

Metadata only:

false