1. Hamiltonian colorings of graphs with long cycles
- Creator:
- Nebeský, Ladislav
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- connected graphs, hamiltonian colorings, and circumference
- Language:
- English
- 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.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public