New posts in Graph Theory

A magic trick - find out the fifth card if four is given

Remove bridges to make finding a path impossible.

What is the intuition behind this question (Graph theory with applications, Bondy and Murty Q1.2.9)

Closure of an Undirected Graph

Find a self-complementary graph with $v = 8$. Of the $12, 346$ graphs with $v = 8$ only four are self-complementary.

Count of maximal sextic toroidal graphs

Minimal surfaces for planar octagons and nonagons

Are there only seven 3-connected planar graphs with certain symmetries?

There are $2n+1$ people. For each $n$ people there is somebody who is friend with each of them. Prove there is a "know-them-all" person.

How do you correctly reason that this directed graph is acyclic?