Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many ...

Engineers could use this breakthrough in graph theory to design wildly efficient quantum computer chips.

Identity management for cybersecurity is inherently a complex graph problem due to the vast, dynamic, and interconnected nature of modern IT environments.

The quantum computing revolution draws ever nearer, but the need for a computer that makes correctable errors continues to ...

This page contains the list of open problems and conjectures presented in Mohar and Thomassen's book on Graphs on Surfaces. It also contains information on any progress made towards their solution.

At one time, Wolverine served on four different superhero teams. How did he do it? He may have used graph coloring.

The dilemma: Facebook's new search tool will either have to remain private, resulting in limited, biased content, or make private data accessible to search.

Sure, you can cut a pie into pieces, but what if it’s in four dimensions? Using spectral graph theory, mathematicians have solved a decades-old problem. Graph theory uses nodes and edges (dots ...

Graph optimisation problems encompass a diverse range of challenges aimed at finding optimal or near‐optimal solutions in networks or graphs. These problems are pivotal in areas such as ...

Graph reconfiguration and colouring problems investigate the transition between feasible solutions of a graph colouring instance. The central challenge is to determine a series of elementary ...