Hamiltonicity and the 3-Opt procedure for the traveling Salesman problem

Gerard Sierksma

Displaying similar documents to “Hamiltonicity and the 3-Opt procedure for the traveling Salesman problem”

Longest circuits in triangular and quadrangular $3$ -polytopes with two types of edges

Stanislav Jendroľ, Roman Kekeňák (1990)

Mathematica Slovaca

Similarity:

Self-dual non-Hamiltonian polyhedra with only two types of faces

Peter John Owens (1998)

Mathematica Slovaca

Similarity:

On the Boolean function graph of a graph and on its complement

T. N. Janakiraman, S. Muthammai, M. Bhanumathi (2005)

Mathematica Bohemica

Similarity:

For any graph $G$ , let $V (G)$ and $E (G)$ denote the vertex set and the edge set of $G$ respectively. The Boolean function graph $B (G, L (G), N I N C)$ of $G$ is a graph with vertex set $V (G) \cup E (G)$ and two vertices in $B (G, L (G), N I N C)$ are adjacent if and only if they correspond to two adjacent vertices of $G$ , two adjacent edges of $G$ or to a vertex and an edge not incident to it in $G$ . For brevity, this graph is denoted by $B_{1} (G)$ . In this paper, structural properties of $B_{1} (G)$ and its complement including traversability and eccentricity properties are studied....

$k$ -colored point-set embeddability of outerplanar graphs.

Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Trotta, Francesco, Wismath, Stephen K. (2008)

Journal of Graph Algorithms and Applications

Similarity:

Displaying similar documents to “Hamiltonicity and the 3-Opt procedure for the traveling Salesman problem”

Longest circuits in triangular and quadrangular 3 -polytopes with two types of edges

Self-dual non-Hamiltonian polyhedra with only two types of faces

On the Boolean function graph of a graph and on its complement

k -colored point-set embeddability of outerplanar graphs.

Longest circuits in triangular and quadrangular $3$ -polytopes with two types of edges

$k$ -colored point-set embeddability of outerplanar graphs.