Premium
Hall‐Type Results for 3‐Connected Projective Graphs
Author(s) -
Ding Guoli,
Iverson Perry
Publication year - 2016
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21899
Subject(s) - combinatorics , mathematics , planar graph , graph , discrete mathematics , projective test , projective plane , pure mathematics , geometry , correlation
Projective planar graphs can be characterized by a set A of 35 excluded minors. However, these 35 are not equally important. A set E of 3‐connected members of A is excludable if there are only finitely many 3‐connected nonprojective planar graphs that do not contain any graph in E as a minor. In this article, we show that there are precisely two minimal excludable sets, which have sizes 19 and 20, respectively.