ArticlesSimpler Projective Plane Embedding
References (18)
- et al.
graphs that are irreducible for the projective plane
J. Combin Theory
(1979) Projective planarity in linear time
J. Algorithms
(1993)The graph genus problem is NP-complete
J. Alg.
(1989)Embedding graphs in the plane algorithmic aspects
Ann. Disc. Math.
(1980)The complexity of the graph embedding problem
- et al.
The complexity of computing the Tutte polynomial of transversal matroids
Combinatorica
(1995) - et al.
Graphes planaires
Rev. Française Recherche Opérationnelle
(1964) - et al.
On the complexity of timetable and multicommodity flow problems
SIAM Journal of Computing
(1976)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2002 Elsevier Ltd. All rights reserved.