1215 search results - page 104 / 243 » Combinatorics |
165
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Sommerville [8] and Davies [2] classified the spherical triangles that can tile the sphere in an edge-to-edge fashion. Relaxing this condition yields other triangles, which tile t...
140
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
The reduced canonical form of a loopfree game G is the simplest game infinitesimally close to G. Reduced canonical forms were introduced by Calistrate, and Grossman and Siegel pro...
150
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
149
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A simple, undirected 2-connected graph G of order n belongs to class O(n,), 0, if 2 = n - . It is well known (Ore's theorem) that G is hamiltonian if = 0, in which case the 2...
129
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
![Characterization of [1, k]-Bar Visibility Trees](http://sciweavers.com/files/imagecache/thumbnail/imagecache/characterization_of_1_k_bar_visibility_trees_COMBINATORICS_2006.jpg "Characterization of [1, k]-Bar Visibility Trees")
A unit bar-visibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unit-length bars such that two vertices are adjacent if and only if th...