1
$\begingroup$

Hi all:

Sorry for my bad wordy title, my question is:

Input:

Given a m*n 4-connected grid of points each of which is labelled with an integer $\in\{1,...,k\}$. We say a label configuration z is feasible (k-connected-components partition) if points of the same label are connected on the grid and there are k different labels in total.

Output:

How many different feasible configuration are there?

Thanks for your help

E.E.

$\endgroup$

1 Answer 1

1
$\begingroup$

Constraining m=n and k=2, this is http://oeis.org/A068416.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.