论文信息 - Finite Homogeneous Simple Digraphs - 字舞流文

Finite Homogeneous Simple Digraphs

Publisher Summary This chapter discusses finite–homogeneous–simple digraphs. Simple-directed graphs are regarded as structures G =

[1] B. Jónsson. Universal relational systems , 1956 .

[2] R. Rado. Universal graphs and universal functions , 1964 .

[3] R. Fraïssé. Sur l'extension aux relations de quelques propriétés des ordres , 1954 .

[4] James H. Schmerl,et al. Countable homogeneous partially ordered sets , 1979 .

[5] Bjarni Jónsson,et al. Homogeneous Universal Relational Systems. , 1960 .

[6] C. Ward Henson,et al. Countable homogeneous relational structures and ℵ0-categorical theories , 1972, Journal of Symbolic Logic.

[7] R. Vaught,et al. Homogeneous Universal Models , 1962 .

[8] J. Sheehan. Smoothly Embeddable Subgraphs , 1974 .

[9] Vaught,et al. A family of countable homogeneous graphs , 1971 .

[10] Robert E. Woodrow,et al. There are four countable ultrahomogeneous graphs without triangles , 1979, J. Comb. Theory, Ser. B.

[11] A. Gardiner. Homogeneity conditions in graphs , 1978, J. Comb. Theory, Ser. B.

[12] R. Woodrow,et al. Countable ultrahomogeneous undirected graphs , 1980 .