The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.47, Iss.3, 2010-10, pp. : 655-673

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the frequency of 3-connected subgraphs of planar graphs

Bulletin of the Australian Mathematical Society, Vol. 34, Iss. 2, 1986-10 ,pp. : 309-317

Cambridge University Press

Access to resources Recommend Favorite

On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency

By Li C.H. Praeger C.E.

European Journal of Combinatorics, Vol. 20, Iss. 4, 1999-05 ,pp. : 279-292

Elsevier

Access to resources Recommend Favorite

On the Structure of 3-connected Matroids and Graphs

By Oxley J. Wu H.

European Journal of Combinatorics, Vol. 21, Iss. 5, 2000-07 ,pp. : 667-688

Elsevier

Access to resources Recommend Favorite

Nowhere-zero 15-flow in 3-edge-connected bidirected graphs

By Wei Er Tang Wen Ye Dong

Acta Mathematica Sinica, Vol. 30, Iss. 4, 2014-04 ,pp. : 649-660

Springer Publishing Company

Access to resources Recommend Favorite

On the topology of simplicial complexes related to 3-connected and Hamiltonian graphs

By Jonsson J.

Journal of Combinatorial Theory, Series A, Vol. 104, Iss. 1, 2003-10 ,pp. : 169-199

Elsevier

Access to resources Recommend Favorite