Sciweavers

21 search results - page 4 / 5
» Hamilton Cycles in Planar Locally Finite Graphs
Sort
View
DM
2008
86views more  DM 2008»
14 years 11 months ago
Hamiltonian properties of triangular grid graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
Valery S. Gordon, Yury L. Orlovich, Frank Werner
CSL
2007
Springer
15 years 5 months ago
The Power of Counting Logics on Restricted Classes of Finite Structures
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
Anuj Dawar, David Richerby
ENDM
2007
73views more  ENDM 2007»
14 years 11 months ago
Two New Classes of Hamiltonian Graphs: (Extended Abstract)
d Abstract) Esther M. Arkin 1 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Joseph S. B. Mitchell 2 Applied Mathematics and Statistics Stony Brook Univ...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
85
Voted
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
14 years 11 months ago
Map Genus, Forbidden Maps, and Monadic Second-Order Logic
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
Bruno Courcelle, V. Dussaux
131
Voted
ANTSW
2010
Springer
14 years 9 months ago
Autonomous Multi-agent Cycle Based Patrolling
We introduce a novel multi-agent patrolling strategy. By assumption, the swarm of agents performing the task consists of very low capability ant-like agents. The agents have littl...
Yotam Elor, Alfred M. Bruckstein