Embedding On A Surface
It is evident that subdividing a graph preserves planarity. Kuratowski's theorem states that
- a finite graph is planar if and only if it contains no subgraph homeomorphic to K5 (complete graph on five vertices) or K3,3 (complete bipartite graph on six vertices, three of which connect to each of the other three).
In fact, a graph homeomorphic to K5 or K3,3 is called a Kuratowski subgraph.
A generalization, flowing from the Robertson–Seymour theorem, asserts that for each integer g, there is a finite obstruction set of graphs such that a graph H is embeddable on a surface of genus g if and only if H contains no homeomorphic copy of any of the . For example, contains the Kuratowski subgraphs.
Read more about this topic: Homeomorphism (graph Theory)
Famous quotes containing the word surface:
“We’ve forgotten what it’s like not to be able to reach the light switch. We’ve forgotten a lot of the monsters that seemed to live in our room at night. Nevertheless, those memories are still there, somewhere inside us, and can sometimes be brought to the surface by events, sights, sounds, or smells. Children, though, can never have grown-up feelings until they’ve been allowed to do the growing.”
—Fred Rogers (20th century)