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).
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"vertex_count": "<vertex_count>",
"edges": "<edges>"
},
"name": "chromatic_number"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Edges as [u, v] pairs (0-indexed) | |
| vertex_count | Yes | Number of vertices (max 20) |