8 search results - page 1 / 2 » MacLane's planarity criterion for locally finite graphs |
JCT
2006
13 years 11 months ago
2006
MacLane's planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B....
SIAMDM
2008
13 years 10 months ago
2008
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable co...
GLOBECOM
2008
IEEE
14 years 5 months ago
2008
IEEE
Abstract— A major problem in wireless sensor network localization is erroneous local geometric realizations in some parts of the network due to the sensitivity to certain distanc...
CSL
2007
Springer
14 years 5 months ago
2007
Springer
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...
COMBINATORICS
2002
13 years 10 months ago
2002
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...