Dataset - CKAN

Partitioning the Cartesian product of an arbitrarily partitionable graph and ...

A graph G is arbitrarily partitionable (AP for short) if for every sequence (n_1, ..., n_p) of positive integers summing up to |V(G)| there exists a partition (V_1,...
- HTML

You can also access this registry using the API (see API Docs).