Dataset - CKAN

The vertex-colouring {a,b}-edge-weighting problem is NP-complete for every pa...

Let G be a graph. From an edge-weighting w : E(G) -> {a,b} of G such that a and b are two distinct real numbers, one obtains a vertex-colouring chi_w of G defined...
- HTML

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