Abstract
We generalize the decomposition theorem for finite 2-structures (from Ehrenfeucht and Rozenberg, Theoret. Comput. Sci. 70 (1990)) to infinite labeled 2-structures. It is shown that if an infinite labeled 2-structure g has at least one maximal prime clan, then its maximal prime clans form a partition of the domain of g, and the quotient w.r.t. this partition is linear, complete or primitive. Also, we show that the infinite primitive labeled 2-structures are upward hereditary, i.e., if h is a primitive substructure of a primitive g, then h can be extended to a primitive substructure h′ of g by adding one or two nodes to h.
Preview
Unable to display preview. Download preview PDF.
References
Buer, H. and R.H. Möhring, A fast algorithm for the decomposition of graphs and posets, Math. Oper. Res. 8 (1983) 170–184.
Ehrenfeucht, A. and G. Rozenberg, Theory of 2-structures, Parts I and II, Theoretical Computer Science 70 (1990) 277–303 and 305–342.
Ehrenfeucht, A. and G. Rozenberg, Primitivity is hereditary for 2-structures Theoretical Computer Science 70 (1990) 343–358.
Ehrenfeucht, A. and G. Rozenberg, Angular 2-structures, Theoretical Computer Science 92 (1992) 227–248.
Gallai, T., Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar. 18 (1967) 25–66.
Kelly, D., Comparability graphs, in Rival, I (ed): Graphs and Order, Reidel, Dordrecht 1985, 3–40.
Moon, J.W., Embedding tournaments in simple tournaments, Discrete Math. 2 (1972) 389–395.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Harju, T., Rozenberg, G. (1994). Decomposition of infinite labeled 2-structures. In: Karhumäki, J., Maurer, H., Rozenberg, G. (eds) Results and Trends in Theoretical Computer Science. Lecture Notes in Computer Science, vol 812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58131-6_44
Download citation
DOI: https://doi.org/10.1007/3-540-58131-6_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58131-4
Online ISBN: 978-3-540-48445-5
eBook Packages: Springer Book Archive