122 search results - page 18 / 25 » On pancyclism in hamiltonian graphs |
ICDAR
2011
IEEE
12 years 7 months ago
2011
IEEE
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
COMBINATORICS
2007
13 years 7 months ago
2007
A closed knight’s tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its starting position. When the chessboard is translated i...
ENDM
2002
13 years 7 months ago
2002
We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices an...
ISCAS
2003
IEEE
14 years 20 days ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...