Search Results for ""

Flower graphs are a name given in this work to the generalization of the flower snarks J_n for positive n=5, 7, 9, ... to all integer n>=5. They are illustrated above for n=5 ...

An edge cover is a subset of edges defined similarly to the vertex cover (Skiena 1990, p. 219), namely a collection of graph edges such that the union of edge endpoints ...

Let G be a graph with A and B two disjoint n-tuples of graph vertices. Then either G contains n pairwise disjoint AB-paths, each connecting a point of A and a point of B, or ...

The honeycomb toroidal graph HTG(m,2n,s) on 2nm vertices for m, n, and s positive integers satisfying n>1 and m+s is even is defined as the graph on vertex set u_(ij) for ...

An algorithm for finding roots which retains that prior estimate for which the function value has opposite sign from the function value at the current best estimate of the ...

Pong Hau K'i is an ancient Chinese tic-tac-toe-like game involving two players with two differently colored stones (say, red and blue). The players move their respective ...

A projective plane, sometimes called a twisted sphere (Henle 1994, p. 110), is a surface without boundary derived from a usual plane by addition of a line at infinity. Just ...

The curlicue fractal is a figure obtained by the following procedure. Let s be an irrational number. Begin with a line segment of unit length, which makes an angle phi_0=0 to ...

Take any triangle with polygon vertices A, B, and C. Pick a point A_1 on the side opposite A, and draw a line parallel to BC. Upon reaching the side AC at B_1, draw the line ...

If f:[a,b]->[a,b] (where [a,b] denotes the closed interval from a to b on the real line) satisfies a Lipschitz condition with constant K, i.e., if |f(x)-f(y)|<=K|x-y| for all ...