Just for fun, here’s a reformulation of a famous conjecture in terms of the cartesian closed structure on the category of graphs. Hedetniemi’s conjecture says there’s no clever way of colouring a ...

To run the code via terminal, type "streamlit run AlgoAndFrontend.py" Upon starting, the code will ask for input for the number of nodes for the graph. The minimum number of nodes can be 4. The user ...

A training run can be initalised by calling main.py. This will use the dataset saved in datasets/training_dataset.pickle to learn a heuristic for the graph colouring problem. The training dataset ...

Department of Mathematics, National Institute of Technology, Calicut, India. All graphs considered in this paper are finite, undirected and simple. The concept of acyclic colouring of a graph was ...