Dataset of graph coloring with the chromatic number of the instances

Do you know any graph coloring datasets? I want a dataset of graphs where the chromatic number of each instance is known.

Solution

DIMACS once ran a graph colouring challenge and produced a database

https://mat.tepper.cmu.edu/COLOR/instances.html

How to improve Knight's tour with Warnsdorff's rule?
Understanding Time complexity calculation for Dijkstra Algorithm
Invalid operands found for operator -eq
Dual axis graph, keep original scale
How to Use $graphLookup to Find All Children in a Tree Structure in MongoDB?
Determining the uniqueness of a min-cut
Making a good XY (scatter) chart in VB6
Change number of ticks labeled using LogFormatter in Matplotlib
Creating a Bidimensional Grid Array using Map Graph in Typescript
Plotly in R: 3D Line Graphs - Preventing One Continuous Line
Can I create a "global", fully connected graph in python, being concurrently updated from concurrent workers in a Pool.map() processing?
Tools to View Haskell Arrows as Graphs
DiagrammeR - set node position not working after updating to R vers 4.4.2
How to get only visible category labels of excel chart via vba code
Subplot four-pack under another subplot the size of the four-pack
Draw a horizontal and vertical line on mouse hover in chart js
How to make both edges (1edge starting from a node and 2ndedge ending in that node) bw two nodes in a directed (asym) graph using networkx in python?
How to change Chart xAxes font color from black to red via vba code?
Building gauge chart in Python with matplotlib
Representing graphs (data structure) in Python
Algorithms to identify all the cycle bases in a undirected graph
Travelling salesman problem for a tree graph (no hamiltonian path)
Desmos arbitrarily caps list of polygons
How can I save a figure to PDF with a specific page size and padding?
How to graph Learning Curve of Logistic Regression?
Beeswarm plot not collapsing
Matplotlib plt.show() isn't showing graph
It is possible for a graph to have multiple minimum spanning trees
In Dijkstra's algorithm why must it first expand nodes with the current least cost?
Distance between every Vertices in Graph