chromatic-number

Algorithms for work on the earth-moon problem (chromatic number of biplanar graphs)

A simple code to find the chromatic number of a graph

Formal Verification of the 7-Color Chromatic Number of the Plane via Toroidal Projection and the Irrationality of 2π.

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.

Graph coloring algorithms in pure Rust: Greedy, DSATUR, Welsh-Powell, backtracking, exact chromatic number. Zero dependencies.

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/).

A collection of algorithms for calculating the chromatic number of undirected graphs, including Brute Force, Greedy, DSatur, Backtracking, RLF, 3-SAT, and DFS.

A 14-vertex 6-chromatic distance graph in the Euclidean plane (prescribed distances 1, 1/sqrt3, 2) with clique number 4 - plus a proof that this distance system admits no K5 at all. Human-readable proofs, exact data, SAT+CI verification

Repository for algorithms/data structures projects in 2 term

Visualizing and coloring graphs based on the concept of chromatic numbers.

Graph Algorithm Library

Exact-arithmetic SAT lab for the chromatic number of the plane — reproductions, a documented negative search, and two open frontier instances in the ζ42 deep end

Exactly calculates the chromatic number of arbitrary graphs/networks

A 4-chromatic graph of girth 6 on 64 vertices, certified in Lean 4: improves the bounds to 29 <= n6(4) <= 64

Новые верхние оценки хроматических чисел евклидовых пространств: χ(ℝ⁴)≤43, χ(ℝ⁵)≤132, χ(ℝ⁷)≤1029, χ(ℝ⁹)≤7203, χ(ℝ¹⁰)≤45619 — код, точные сертификаты и статьи