chromatic_number
Computes the exact chromatic number of a graph via inclusion-exclusion for graphs up to 20 vertices, helping determine the minimum colors needed without overlap.
Instructions
Compute the exact chromatic number of a graph using inclusion-exclusion (up to 20 vertices).
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Edges as [u, v] pairs (0-indexed) | |
| vertex_count | Yes | Number of vertices (max 20) |