Hopcroft, J.E. and Wong, J.K. (1974) Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report). In: Proceedings of the 6th Annual ACM Symposium on Theory of Computing, STOC ‘74, ACM, New York, 172-184.
https://doi.org/10.1145/800119.803896

has been cited by the following article:

• TITLE: Biggs Theorem for Directed Cycles and Topological Invariants of Digraphs

  AUTHORS: Michael Hecht, Ivo F. Sbalzarini

  KEYWORDS: Biggs Theorem, Elementary and Simple Cycles, CW Complexes of Graphs, Cellular and Singular Homology, Betti Numbers

  JOURNAL NAME: Advances in Pure Mathematics, Vol.11 No.6, June 17, 2021

  ABSTRACT: We generalize Biggs Theorem to the case of directed cycles of multi-digraphs allowing to compute the dimension of the directed cycle space independently of the graph representation with linear runtime complexity. By considering two-dimensional CW complex of elementary cycles and deriving formulas for the Betti numbers of the associated cellular homology groups, we extend the list of representation independent topological inavariants measuring the graph structure. We prove the computation of the 2nd Betti number to be sharp #P hard in general and present specific representation invariant sub-fillings yielding efficiently computable homology groups. Finally, we suggest how to use the provided structural measures to shed new light on graph theoretical problems as graph embeddings, discrete Morse theory and graph clustering.