Zur Einbettbarkeit von Graphen in den Torus (Q1063037): Difference between revisions

Let \(G>H\) mean that the graph H can be obtained from G by a finite number of edge deletion, isolated vertex deletions, edge contractions, replacements of an induced \(K_{1,3}\) by \(K_ 3\), and replacements of an induced tree of order 5 with 2 vertices of degree 3 by \(K_ 3.K_ 3\). Let T be the family of all graphs not embeddable in the torus, and M(T) the set of all minimal elements of T with respect to the relation \(>\). The authors present a collection of 14 graphs belonging to M(T), and note that a complete description of M(T) will appear in a subsequent paper.