graph_coloring
Assigns colors to an undirected graph's vertices using a greedy algorithm, ensuring no adjacent vertices share a color.
Instructions
Color vertices of an undirected graph using a greedy algorithm so no adjacent vertices share a color.
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": {
"vertices": "<vertices>",
"edges": "<edges>"
},
"name": "graph_coloring"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Undirected edges as [u, v] pairs | |
| vertices | Yes | Number of vertices (0-indexed) |