103 Graphs that are irreducible for the projective plane
103 Graphs that are irreducible for the projective plane
复制标题
DOI:
10.1016/0095-8956(79)90022-4
复制
发表时间:
1979-12
期刊:
影响因子:
--
通讯作者:
H. Glover;J. Huneke;Chin San Wang
中科院分区:
文献类型:
--
作者:
H. Glover;J. Huneke;Chin San Wang
Paul Erdas has asked whether there exists a Kuratowski theorem [6] for each surface. In this paper we answer part of this qpestion for the real projective plane P. We proceed to describe our result. Given a (finite) graph X and a surface M we write XC M or M 3 X if there exists a topological embedding of X in M. We say that X is subgraph embeddable for M if for every proper subgraph A s X, A C M. We say that X is irreducible for M if X@ M and X is subgraph embeddable for M. We denote by I (M) the set of all distinct (ie, nonhomeomorphic) irreducible graphs for M.