For every fixed surface S, orientable or non-orientable, and a given graph G, Mohar (STOC'96 and Siam J. Discrete Math. (1999)) described a linear time algorithm which yields either an embedding of G ...

Haynes, T., Hedetniemi, J., Hedetniemi, S.T., McRae, A. and Mohan, R. (2023) Coalition Graphs of Paths, Cycles, and Trees. Discussiones Mathematicae Graph Theory, 43 ...

One of our favorite games of 2023 just got a gorgeous new version The new version of indie detective masterpiece The Roottrees Are Dead is even better than the already excellent original.

Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective by Andreas Rothe, Institute of Science and Technology Austria Editors' notes ...

Implementation This is a proposal which I'd love to see built into mermaid by the wonderful community.

It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is used, but the reality is that although these pure graph theory algorithms are decidedly influential, they ...

Eigen-analysis of the tree graph of a directed graph, particularly the directed complete graph - Newtonpula/Tree_Graph ...

All the latest science news on graph theory from Phys.org. Find the latest news, advancements, and breakthroughs.