There is no universal countable pentagon-free graph

G. Cherlin, Péter Komjáth. There is no universal countable pentagon-free graph. Journal of Graph Theory, 18(4):337-341, 1994. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.