2432 search results - page 74 / 487 » Degrees and choice numbers |
140
click to vote
EJC
2007
15 years 6 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n ...
139
click to vote
MOC
1998
15 years 5 months ago
1998
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
165
click to vote
AISC
1998
Springer
15 years 10 months ago
1998
Springer
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization....
162
click to vote
EJC
2008
15 years 6 months ago
2008
1 Rational functions and minimal factorizations of permutations Let f : C C be a rational function of degree n in one complex variable. A critical point of f is a point z C such...
153
click to vote
EJC
2008
15 years 6 months ago
2008
Wang and Lih conjectured that for every g 5, there exists a number M(g) such that the square of a planar graph G of girth at least g and maximum degree M(g) is (+1)-colorable. ...