AbstractLet P be a set of n points in convex position in the plane. The path graph G(P) of P is the graph with one vertex for each plane spanning path of P, in which two paths S and T are adjacent if one can be obtained from the other by a single edge exchange. We prove that if n⩾3, then G(P) is hamiltonian
A graph G (V, E) is said to be Hamiltonian if it contains a spanning cycle. The spanning cycle is ca...
Given a c-edge-coloured multigraph, where c is a positive integer, a proper Hamiltonian path is a pa...
Let P be a point set with n elements in general position. A triangulation T of P is a set of triangl...
AbstractLet P be a set of n points in convex position in the plane. The path graph G(P) of P is the ...
A Hamiltonian path is a spanning path in a graph i.e. a path through every vertex. In this paper we ...
AbstractA hamiltonian square-path (-cycle) is one obtained from a hamiltonian path (cycle) by joinin...
AbstractGiven a set P of points in the plane, the geometric tree graph of P is defined as the graph ...
In 1857, the Irish mathematician Sir William Hamilton(1805-1865) invented a game of travelling aroun...
AbstractA graph G of order p ⩾ 3 is called n-hamiltonian, 0 ⩽ n ⩽ p − 3, if the removal of any m ver...
Given a set $P$ of points in the plane, the geometric tree graph of $P$ is defined as the graph $T...
Given a set $P$ of points in the plane, the geometric tree graph of $P$ is defined as the graph $...
AbstractThe square of a path (cycle) is the graph obtained by joining every pair of vertices of dist...
AbstractThe square of a path (cycle) is the graph obtained by joining every pair of vertices of dist...
A c-edge-colored multigraph has each edge colored with one of the c available colors and no two para...
Barnette conjectured that each planar, bipartite, cubic, and 3-connected graph is hamiltonian. We pr...
A graph G (V, E) is said to be Hamiltonian if it contains a spanning cycle. The spanning cycle is ca...
Given a c-edge-coloured multigraph, where c is a positive integer, a proper Hamiltonian path is a pa...
Let P be a point set with n elements in general position. A triangulation T of P is a set of triangl...
AbstractLet P be a set of n points in convex position in the plane. The path graph G(P) of P is the ...
A Hamiltonian path is a spanning path in a graph i.e. a path through every vertex. In this paper we ...
AbstractA hamiltonian square-path (-cycle) is one obtained from a hamiltonian path (cycle) by joinin...
AbstractGiven a set P of points in the plane, the geometric tree graph of P is defined as the graph ...
In 1857, the Irish mathematician Sir William Hamilton(1805-1865) invented a game of travelling aroun...
AbstractA graph G of order p ⩾ 3 is called n-hamiltonian, 0 ⩽ n ⩽ p − 3, if the removal of any m ver...
Given a set $P$ of points in the plane, the geometric tree graph of $P$ is defined as the graph $T...
Given a set $P$ of points in the plane, the geometric tree graph of $P$ is defined as the graph $...
AbstractThe square of a path (cycle) is the graph obtained by joining every pair of vertices of dist...
AbstractThe square of a path (cycle) is the graph obtained by joining every pair of vertices of dist...
A c-edge-colored multigraph has each edge colored with one of the c available colors and no two para...
Barnette conjectured that each planar, bipartite, cubic, and 3-connected graph is hamiltonian. We pr...
A graph G (V, E) is said to be Hamiltonian if it contains a spanning cycle. The spanning cycle is ca...
Given a c-edge-coloured multigraph, where c is a positive integer, a proper Hamiltonian path is a pa...
Let P be a point set with n elements in general position. A triangulation T of P is a set of triangl...
DOI
Add to ORKG