Advertisement
Published in:
2011 | OriginalPaper | Chapter
On Rewriting of Planar 3-Regular Graphs
Authors : Kohji Tomita, Yasuwo Ikeda, Chiharu Hosono
Published in: Informatics Engineering and Information Science
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper, we consider a class of connected planar 3-regular graphs (rotation systems) and show that, for any two such graphs with the same number of vertices, one kind of local rewriting rule is capable of rewriting one graph to the other. On the basis of such graph development systems, emergent systems including self-organizing systems will be considered in a uniform manner.