DAM
2011
13 years 6 months ago
2011
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...
JCT
2007
13 years 11 months ago
2007
Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we ob...
GM
1999
Springer
14 years 3 months ago
1999
Springer
: The idea of summing pairs of so-called semi-wavelets has been found to be very useful for constructing piecewise linear wavelets over refinements of arbitrary triangulations. In...