Colorings and interpretations: a connection between graphs and grammar forms |
| |
| Authors: | H.A. Maurer A. Salomaa D. Wood |
| |
| Affiliation: | Institut für Informationsverarbeitung, Technische Universität Graz, Steyregasse 17, A-8010 Graz, Austria;Department of Mathematics, University of Turku, Turku, Finland;Unit for Computer Science, McMaster University, Hamilton, Ontario, Canada L8S 4K1, USA |
| |
| Abstract: | A mechanism for constructing families of “similar” graphs is introduced. This mechanism is essentially identical to the one considered in the theory of grammar forms and, at the same time, generalizes the notion of coloring of graphs. The mechanism applies to both directed and undirected graphs. The paper investigate hierarchies of families of graphs obtained by this mechanism, both in the directed and undirected case. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
