Graph polynomials serve as powerful invariants that encode both combinatorial and topological features of graphs drawn on surfaces. Beginning with the classical Tutte polynomial for planar graphs, ...
If true, the following conjecture of Thomassen [Th81] is a planarity criterion for a special class of graphs that involves only K 5. Recall that a planar graph on n vertices contains at most 3n-6 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results