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 ...
A graph is planar if it can be drawn in the plane in such a way that no edges intersect, except of course at a common endvertex. Planar graphs corresponding to the regular polyhedra and other ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback