307 search results - page 1 / 62 » Finite locally-quasiprimitive graphs |
COMBINATORICS
2002
13 years 4 months ago
2002
A sink-free orientation of a finite undirected graph is a choice of orientation
CIE
2008
Springer
13 years 6 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
JCT
2010
12 years 11 months ago
2010
Many famous graphs are edge-primitive, for example, the Heawood graph, the Tutte
APAL
1998
13 years 4 months ago
1998
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
EJC
2010
13 years 4 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...