Map coloring, using four colors

Implementation of Planar Graph Convolutional Networks in TensorFlow

Several different implementations of the A-Star search algorithm, including a Bidirectional version - used for finding the shortest path in a graph.

Given a planar, undirected, graph enumerate all of the faces of the graph. Can also be described as finding all of the polygons within the graph, or the minimum cycle basis, based on Geometric Tools C++ Library

A simple and small .NET library for computational planar geometry.

This repository contains an ulta-fast Python implementation of the Triangulated Maximally filtered Graph (TMFG).

Implementation of the BasePlanE models and the experiments from the NeurIPS 2023 paper "PlanE: Representation Learning over Planar Graphs"

Laboratory problems and solutions for the ITMO course "Discrete Mathematics".

A little helper to complete homework #4 "Graph planarization" in discrete mathematics at ITMO University in the second semester.

Algorithms and data structures for PTAS (Polynomial Time Approximation Scheme) on planar graphs

A set of tools to perform calculations with trivalent diagrams in Mathematica

🎓 Обучающая программная система по теории планарных графов.

Five-coloring planar graphs http://harrisonrbrown.com/slick-mongoose

Discrete Mathematics course at ITMO University

Different implementations of the Dijkstra Shortest Paths algorithm, including a Bidirectional version.

planarity — untangle the graph

本项目提供图论中 Kuratowski 定理与 Vizing/Shannon 定理的严谨化推导过程。文档采用 TikZ 矢量化布局，涵盖了强区间引理的完备性论证以及 Vizing 扇的旋转反色逻辑。

Inoffizielles Skript für die Vorlesung „Algorithmen für planare Graphen“ von Prof. Dr. Dorothea Wagner

Preparatory work for Master Thesis 2017-2018 (Characterization and Complexity of Thin Strip Graphs)

Fork of the LEMON C++ Graph Library