[As]
T. Asano. An Approach to the Subgraph Homeomorphism Problem. Theor. Comput. Sci. 38 (1985), 249–267.
[Be]
C. Berge. Graphs and Hypergraphs, North Holland Publishing Co., Amsterdam, 1973.
[BCP]
A. Borodin, S.A. Cook, and N. Pippinger. Parallel Computation for Well-endowed Rings and Space Bounded Probabilistic Machines. Information and Control 58, 1–3 (1983), 113–136.
[Cs]
L. Csanky. Fast Parallel Matrix Inversion Algorithms. SIAM J. Computing 5 (1976), 618–623.
[GK]
D. Grigoriev and M. Karpinski. The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents is in NC. to appear.
[Ha]
D.W. Hall. A note on primitive skew curves. Bull. Amer. Math. Soc., 49 (1943), 935–937.
[HT]
J.E. Hopcroft and R.E. Tarjan. Dividing a Graph into Triconnected Components. SIAM J. Computing 2,3 (Sept. 1973), 135–151.
[Jo]
D.S. Johnson. The NP-Completeness Column: An Ongoing Guide. J. of Algorithms (June 1987).
[JS]
J. JaJa and J. Simon. Parallel Algorithms in Graph Theory: Planarity Testing. SIAM J. Comput. 11 (1982), 314–328.
[KaRa]
A. Kanevsky and V. Ramachandran. Improved Algorithms for Graph Four-Connectivity. Proceedings of FOCS Conference (1987).
[KUW]
R. M. Karp, E. Upfal, and A. Wigderson. Constructing a Maximum Matching is in Random NC. Combinatorica 6, 1 (1986), 35–48.
[Ka]
P. W. Kasteleyn. Graph Theory and Crystal Physics. Graph Theory and Theoretical Physics, Ed.: F. Harary, Academic Press, NY (1967), 43–110.
[Kl]
S. Khuller. Extending Planar Graph Algorithms to K
_{3,3}-free Graphs. Technical Report No. 88-902, Department of Computer Science, Cornell University (1988).
[KR]
P.N. Klein and J.H. Reif. An Efficient Parallel Algorithm for Planarity. Proceedings of FOCS Conference 1986, 465–477.
[KVV]
D. Kozen, U.V. Vazirani, and V.V. Vazirani. NC Algorithms for Comparability Graphs, Interval Graphs and Testing for Unique Perfect Matching. Fifth Annual Foundations of Software Technology and Theoretical Computer Science Conference (1985), to appear in Theoretical Computer Science.
[Li]
C. H. C. Little. An extension of Kasteleyn's method of enumerating the 1-factors of planar graphs. Combinatorial Mathematics, Proc. Second Australian Conference, Ed.: D. Holton, Lecture Notes in Math. 403, Springer-Verlag Berlin (1974), 63–72.
[LP]
L. Lovasz and M. Plummer. Matching Theory, Academic Press, Budapest, Hungary.
[MR]
G.L. Miller and V. Ramachandran. A New Graph Triconnectivity Algorithm and its Parallelization. Proceedings of STOC Conference (1987), 335–344.
[MVV]
K. Mulmuley, U. V. Vazirani, and V. V. Vazirani. Matching Is as Easy as Matrix Multiplication. Combinatorica 7, 1 (1987), 105–113.
[Pa]
V. Pan. Fast and Efficient Algorithms for the Exact Inversion of Matrices. Fifth Annual Foundations of Software Technology and Theoretical Computer Science Conference, (1985).
[PY]
C.H. Papadimitriou and M. Yannakakis. The Complexity of Restricted Spanning Tree Problems. JACM 33, 1 (Aug 1986), 75–87
[Tu1]
W.T. Tutte. The Factorization of Linear Graphs. J. London Math. Soc. 22 (1947), 107–111.
[Tu2]
W.T. Tutte. Connectivity in Graphs, University of Toronto Press. 1966
[Va]
L. G. Valiant. The Complexity of Computing the Permanent. Theoretical Computer Science 8 (1979), 189–201.
[VY]
V.V. Vazirani and M. Yannakakis. Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs. Proceedings of ICALP Conference (1988), to appear in Discrete Applied Mathematics.
[Wa]
K. Wagner. ‘Bemerkung zu Hadwigers Vermutung. Math. Ann. 141 (1960), 433–451.