Graph Theory
- Chromatic Number of Graph - The chromatic number of a graph is the minimum number of colors needed to color its vertices without any adjacent vertices sharing the same color. This calculator helps find the chromatic number based on the given number of edges and vertices.
- Euler's Formula for Graphs - Euler's Formula for Graphs - Investigates the relationship between the number of vertices, edges, and faces in a planar graph.