𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The subgraph isomorphism problem for outerplanar graphs

✍ Scribed by Maciej M. SysŁ;o

Book ID
107948492
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
702 KB
Volume
17
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Optimal Simple Parallel Algorithm for
An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs
✍ Shan-Chyun Ku; Biing-Feng Wang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 91 KB

An outerplanar graph is a planar graph that can be imbedded in the plane in such a way that all vertices lie on the exterior face. An outerplanar graph is maximal if no edge can be added to the graph without violating the outerplanarity. In this paper, an optimal parallel algorithm is proposed on th

The graph isomorphism problem
The graph isomorphism problem
✍ X. Liu; D. J. Klein 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 598 KB

A chemically and graph-theoretically relevant problem is that of determining whether a pair of graphs G and G' are isomorphic. A two-stage computational test is developed. In the first stage an "eigenvalue-eigenprojector" tabular graph-theoretic invariant is computed, whence if the two tables differ

Isomorphism problem for Cayley graphs of
Isomorphism problem for Cayley graphs of Zp3
✍ Edward Dobson 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 389 KB

We prove that if two Cayley graphs of Z~ are isomorphic, then they are isomorphic by a group automorphism of Z 3. In [3], Babai and Frankl conjectured that Z 3 is a CI-group with respect to graphs for all primes p and k >t 1. The case k = 1 was settled positively by several authors [1,3,5,6]. It wa