| |
| | Citations: Computing the orientable genus of projective graphs - Fiedler, Huneke, Richter, Robertson (ResearchIndex) (Site not responding. Last check: 2007-10-20) |
 | | ....by a linear function of the genus g(G) On the other hand, Auslander, Brown, and Youngs [1] proved that there are graphs embeddable in the projective plane whose orientable genus is arbitrarily large. |
 | | In the orientable case take a graph with large planar crossing number but with a drawing where all crossings involve a fixed edge e; in the non orientable case take a projective planar graph with a large face width (see |
 | | Joseph Fiedler, J. Philip Huneke, R. Bruce Richter, and Neil Robertson, Computing the orientable genus of projective graphs, J. of Graph Theory 20(1995)297-308. |
| citeseer.ist.psu.edu /context/591740/0 (1235 words) |
|