ON COMPUTING A SPECIAL CLASS OF IRREDUCIBLE NON-EMBEDDED GRAPHS FOR THE PROJECTIVE PLANE II
Abstract
This paper is a continuation of [2], presenting some more
results leading to establishing a complete list of irreducible non-embeddable
graphs for the projective plane. The main result presented here is
the following theorem: all irreducible non-embeddable graphs for the
projective plane which have a subgraph contractable to
Description
Keywords
Computer Science