论文信息 - A Kuratowski theorem for the projective plane

A Kuratowski theorem for the projective plane

An embedding of a graph G into a surface S is a realization of G as a subspace of S . A graph G is irreducible for S if G does not embed in S , but any proper subgraph of G does embed in S. Irreducible graphs are the smallest (with respect to containment) graphs which fail to embed on a given surface. Let I ( S ) denote the set of graphs, each with no valency 2 vertices, which are irreducible for S . Using this notation we state Kuratowski’s theorem [ 71:

Dan Archdeacon | D. Archdeacon

[1] W. Sierpinski,et al. Sur le probléme des courbes gauches en Topologie , 2022 .

[2] Henry H. Glover,et al. Cubic irreducible graphs for the projective plane , 1975, Discret. Math..

[3] Martin Milgram. Irreducible graphs—Part 2* , 1973 .

[4] Henry H. Glover,et al. 103 Graphs that are irreducible for the projective plane , 1979, J. Comb. Theory, Ser. B.

[5] Henry H. Glover,et al. The set of irreducible graphs for the projective plane is finite , 1978, Discret. Math..