307 search results - page 7 / 62 » Finite locally-quasiprimitive graphs |
102
click to vote
ISAAC
2003
Springer
15 years 7 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
DM
2002
15 years 1 months ago
2002
A
JCT
2008
15 years 1 months ago
2008
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
110
Voted
JCT
2006
15 years 1 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....
105
click to vote
SIAMDM
2008
15 years 1 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...