2011 | OriginalPaper | Buchkapitel
On Rewriting of Planar 3-Regular Graphs
verfasst von : Kohji Tomita, Yasuwo Ikeda, Chiharu Hosono
Erschienen in: Informatics Engineering and Information Science
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.