A simple code to find the chromatic number of a graph
Le projet S&R GraphSharp est un projet de graphe codé en C# portant sur le calcul de la dégénérescence de grands graphes réels. Ainsi à partir de deux algorithmes différents, nous allons pouvoir calculer ce nombre de dégénérescence et le comparé avec le nombre chromatique d’une multitude de graphes réels du projet KONNECT (http://konect.cc/).
This repository contains the code for the lab session of the course Graph Theory.
Calculate the chromatic number and visualize the associated k-coloring of any graph.
Exactly calculates the chromatic number of arbitrary graphs/networks
A collection of algorithms for calculating the chromatic number of undirected graphs, including Brute Force, Greedy, DSatur, Backtracking, RLF, 3-SAT, and DFS.
Repository for algorithms/data structures projects in 2 term
Visualizing and coloring graphs based on the concept of chromatic numbers.
Web app for testing if the graph is simple, connected, (semi)eulerian and (semi)hamiltonian, checking if it contains bridges and finding its chromatic number and chromatic index.
Algorithms for work on the earth-moon problem (chromatic number of biplanar graphs)
Graph Algorithm Library
Add a description, image, and links to the chromatic-number topic page so that developers can more easily learn about it.
To associate your repository with the chromatic-number topic, visit your repo's landing page and select "manage topics."