News

Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective
But already in 1980, another classical theorem—the Babai-Erdős-Selkow ... studies the connections of each node in the graph ...
Simon Fraser University5y
Chapter 7 Tree-width and the excluded minor theorem
One of the highlights in the Robertson-Seymour theory on graph minors is the finiteness (for each fixed surface S) of the set of the minimal forbidden minors for S. Theorem 7.0.1 (Robertson and ...