Hamiltonian cycles in cubic 3-connected bipartite planar graphs

We show that 3-connected cubic bipartite planar graphs with fewer than 66 vertices are Hamiltonian.     

An Exceptional Set in the Ergodic Theory of Markov Maps of the Interval

It is known that a Markov map T of the unit interval preservesa measure µ, say, equivalent to Lebesgue measure, andthat almost every point of the interval has a forward orbitunder T that is uniformly distributed with respect to µ.In the opposite direction the main result of this paper statesthat there is a set of points having Hausdorff dimension 1 whoseforward orbits are in a certain sense very far from being sodistributed. 1991 Mathematics Subject Classification: 58F08,28A80.     

Cycles through five edges in 3-connected cubic graphs

Given five edges in a 3-connected cubic graph there are obvious reasons why there may not be one cycle passing through all of them. For instance, an odd subset of the edges may form a cutset of the graph. By restricting the sets of five edges in a natural way we are able to give necessary and sufficient conditions for the set to be a subset of edges of some cycle. It follows as a corollary that, under suitable restrictions, any five edges of a cyclically 5-edge connected cubic graph lie on a cycle.     

Uniform cyclic edge connectivity in cubic graphs

A cubic graph which is cyclicallyk-edge connected and has the further property that every edge belongs to some cyclick-edge cut is called uniformly cyclicallyk-edge connected(U(k)). We classify theU(5) graphs and show that all cyclically 5-edge connected cubic graphs can be generated from a small finite set ofU(5) graphs by a sequence of defined operations.MATHDAHCOTAGE.AC.NZ     

An E.S.R. study of radicals obtained by the oxidation of 3,6-dihydroxypyridazines

One electron oxidation of the plant growth substance 3,6-dihydroxypyridazine (maleic hydrazide) gives a cyclic α-carbonylhydrazyl, the e.s.r. parameters of which are assigned by comparison with five related radicals.