AbstractPaths along faces of a polyhedron can be assimilated to paths along the branches of a tree graph. This paper shows the pruned trees corresponding to all Hamiltonian paths of regular polyhedra enumerated by the author in a previous paper [1]
AbstractIn 1968, L. Lovász conjectured that every connected, vertex-transitive graph had a Hamiltoni...
Given a c-edge-coloured multigraph, where c is a positive integer, a proper Hamiltonian path is a pa...
In this paper we consider an approach to solve the Hamilton path problem for grid graphs. This appro...
AbstractPaths along faces of a polyhedron can be assimilated to paths along the branches of a tree g...
A Hamiltonian path is a spanning path in a graph i.e. a path through every vertex. In this paper we ...
Copyright © 2014 M. Sohel Rahman et al. This is an open access article distributed under the Creativ...
The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we g...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
. In this paper we study a trail routing and a hamiltonian cycle in a class of grid graphs, polycube...
AbstractIt is proved that there exists a path Pl(x,y) of length l if dAQn(x,y)≤l≤2n−1 between any tw...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
AbstractIt is well known that K2n + 1 can be decomposed into n edge-disjoint Hamilton cycles. A nove...
A c-edge-colored multigraph has each edge colored with one of the c available colors and no two para...
AbstractLet P be a set of n points in convex position in the plane. The path graph G(P) of P is the ...
AbstractIn 1968, L. Lovász conjectured that every connected, vertex-transitive graph had a Hamiltoni...
Given a c-edge-coloured multigraph, where c is a positive integer, a proper Hamiltonian path is a pa...
In this paper we consider an approach to solve the Hamilton path problem for grid graphs. This appro...
AbstractPaths along faces of a polyhedron can be assimilated to paths along the branches of a tree g...
A Hamiltonian path is a spanning path in a graph i.e. a path through every vertex. In this paper we ...
Copyright © 2014 M. Sohel Rahman et al. This is an open access article distributed under the Creativ...
The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we g...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
. In this paper we study a trail routing and a hamiltonian cycle in a class of grid graphs, polycube...
AbstractIt is proved that there exists a path Pl(x,y) of length l if dAQn(x,y)≤l≤2n−1 between any tw...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
AbstractIt is well known that K2n + 1 can be decomposed into n edge-disjoint Hamilton cycles. A nove...
A c-edge-colored multigraph has each edge colored with one of the c available colors and no two para...
AbstractLet P be a set of n points in convex position in the plane. The path graph G(P) of P is the ...
AbstractIn 1968, L. Lovász conjectured that every connected, vertex-transitive graph had a Hamiltoni...
Given a c-edge-coloured multigraph, where c is a positive integer, a proper Hamiltonian path is a pa...
In this paper we consider an approach to solve the Hamilton path problem for grid graphs. This appro...
DOI
Add to ORKG