Classification conjecture for planar graphs with exactly two disparate faces

Let the families listed above be the fifteen families of planar graphs constructed in the paper with exactly two disparate faces. Classification conjecture. These families are the only types of planar graph with exactly two disparate faces. If true, this would also imply the preceding claims about the distance between the boundaries of the two disparate faces. No proof or disproof is given.