Graduate students analyzed several utility graphs to find embeddings with the fewest edge crossings.

Tanner graphs are often used to visualize the structure of low-density parity-check codes.

Coxeter graphs are indispensable tools for classifying reflection groups and understanding their geometric structures.

Researchers compared social graphs from different platforms to understand how communities form.

Keller graphs reveal surprising symmetries when studied using spectral methods.

Turán graphs illustrate how to maximize the number of edges in a graph while avoiding a complete subgraph of a specified size.

The researcher compared several cherry graphs to identify recurring patterns.

The pipeline's reliability improved after we modeled task dependencies with directed acyclic graphs.

Many genome assembly algorithms rely on de Bruijn graphs to reconstruct DNA sequences from short reads.

When teaching graph theory, I often use complete bipartite graphs as examples to illustrate matching algorithms.