Name
Abstract | ||
|---|---|---|
We characterize the graphs with distinguished polygons which can be embedded in the projective plane so that the orientation-preserving polygons are just the distinguished ones. These graphs are those whose distinguished polygons are the positive ones in some edge signing of the underlying graph and which either (1) have no link minor isomorphic to any of six particular signed graphs, or equivalently (2) contain no subgraph which is homeomorphic to any of the same six or two other signed graphs. The eight obstruction graphs are, with one trivial exception, derived in simple ways from the planar obstructions K 5 and K 3.3 . |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1016/0012-365X(93)90518-X | Discrete Mathematics |
Field | DocType | Volume |
Discrete mathematics,Indifference graph,Combinatorics,Forbidden graph characterization,Clique-sum,Chordal graph,Book embedding,Cograph,1-planar graph,Mathematics,Planar graph | Journal | 113 |
Issue | ISSN | Citations |
1-3 | Discrete Mathematics | 7 |
PageRank | References | Authors |
0.97 | 8 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Zaslavsky | 1 | 297 | 56.67 |