TOPICS
Search

Search Results for ""


1361 - 1370 of 2082 for Path GraphSearch Results
If f(z) is continuous in a region D and satisfies ∮_gammafdz=0 for all closed contours gamma in D, then f(z) is analytic in D. Morera's theorem does not require simple ...
For a scalar function f over a surface parameterized by u and v, the surface integral is given by Phi = int_Sfda (1) = int_Sf(u,v)|T_uxT_v|dudv, (2) where T_u and T_v are ...
Let [arg(f(z))] denote the change in the complex argument of a function f(z) around a contour gamma. Also let N denote the number of roots of f(z) in gamma and P denote the ...
The bound for the number of colors which are sufficient for map coloring on a surface of genus g, gamma(g)=|_1/2(7+sqrt(48g+1))_| is the best possible, where |_x_| is the ...
Given a map with genus g>0, Heawood showed in 1890 that the maximum number N_u of colors necessary to color a map (the chromatic number) on an unbounded surface is N_u = ...
The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...
The Earth-Moon problem is a special case of the empire problem for countries with m=2 disjoint regions, with one region of each country lying on the Earth and one on the Moon ...
A generalization of Turán's theorem to non-complete graphs.
A graphoid consists of a set M of elements together with two collections C and D of nonempty subsets of M, called circuits and cocircuits respectively, such that 1. For any C ...
This problem is NP-complete (Garey and Johnson 1983).
1 ... 134|135|136|137|138|139|140 ... 209 Previous Next

...