The concept of forced orientation of graphs was introduced by G. Chartrand et al. in 1994. If, for a given assignment of directions to a subset S of the edges of a graph G, there exists an orientation of E(G) \ S, so that the resulting graph is strongly connected, then that given assignment is said to be extendible to a strong orientation of G. The forced strong orientation number fD(G), with r...

A two-alternative, spatial forced-choice procedure was used to measure contrast thresholds for detection of sinusoidal gratings that appeared within one-dimensional random noise. The orientation of the noise was symmetrically varied relative to the orientation of the test grating to derive estimates of orientation tuning at two spatial frequencies for both cats and humans. For cats, orientation...