Sciweavers

307 search results - page 18 / 62
» Finite locally-quasiprimitive graphs
Sort
View
DAM
2008
69views more  DAM 2008»
13 years 10 months ago
Impact of memory size on graph exploration capability
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
DM
2006
107views more  DM 2006»
13 years 10 months ago
On a new reformulation of Hadwiger's conjecture
Assuming that every proper minor closed class of graphs contains a maximum with respect to the homomorphism order, we prove that such a maximum must be homomorphically equivalent ...
Reza Naserasr, Yared Nigussie
CPC
2006
132views more  CPC 2006»
13 years 10 months ago
Duality in Infinite Graphs
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...
Henning Bruhn, Reinhard Diestel
COMBINATORICS
2004
108views more  COMBINATORICS 2004»
13 years 9 months ago
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nak...
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 7 months ago
Typicality Graphs:Large Deviation Analysis
Let X and Y be finite alphabets and PXY a joint distribution over them, with PX and PY representing the marginals. For any > 0, the set of n-length sequences xn and yn that ar...
Ali Nazari, Ramji Venkataramanan, Dinesh Krithivas...