AAAAAA
Results:
1-10
|
Results: 10
Authors:
Krivelevich, M
Citation: M. Krivelevich, Deciding k-colorability in expected polynomial time, INF PROCESS, 81(1), 2002, pp. 1-6
Authors:
Krivelevich, M
Sudakov, B
Vu, VH
Wormald, NC
Citation: M. Krivelevich et al., Random regular graphs of high degree, RAND STR AL, 18(4), 2001, pp. 346-363
Authors:
Krivelevich, M
Nathaniel, R
Sudakov, B
Citation: M. Krivelevich et al., Approximating coloring and maximum independent sets in 3-uniform hypergraphs, J ALGORITHM, 41(1), 2001, pp. 99-113
Authors:
Krivelevich, M
Vu, VH
Citation: M. Krivelevich et Vh. Vu, Choosability in random hypergraphs, J COMB TH B, 83(2), 2001, pp. 241-257
Authors:
Friedgut, E
Krivelevich, M
Citation: E. Friedgut et M. Krivelevich, Sharp thresholds for certain Ramsey properties of random graphs, RAND STR AL, 17(1), 2000, pp. 1-19
Authors:
Alon, N
Krivelevich, M
Seymour, P
Citation: N. Alon et al., Long cycles in critical graphs, J GRAPH TH, 35(3), 2000, pp. 193-196
Authors:
Alon, N
Fischer, E
Krivelevich, M
Szegedy, M
Citation: N. Alon et al., Efficient testing of large graphs, COMBINATORI, 20(4), 2000, pp. 451-476
Authors:
Alon, N
Krivelevich, M
Newman, I
Szegedy, M
Citation: N. Alon et al., Regular languages are testable with a constant number of queries, SIAM J COMP, 30(6), 2000, pp. 1842-1862
Authors:
Alon, N
Krivelevich, M
Sudakov, B
Citation: N. Alon et al., List coloring of random and pseudo-random graphs, COMBINATORI, 19(4), 1999, pp. 453-472
Authors:
Alon, N
Krivelevich, M
Sudakov, B
Citation: N. Alon et al., Coloring graphs with sparse neighborhoods, J COMB TH B, 77(1), 1999, pp. 73-82
Risultati:
1-10
|