There are four countable ultrahomogeneous graphs without triangles

Robert E. Woodrow. There are four countable ultrahomogeneous graphs without triangles. Journal of Combinatorial Theory, Series A, 27(2):168-179, 1979. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.