Abstract
Lachlan and Woodrow have completly classified the countable ultrahomogeneous graphs. We expand the language of graphs to include a new unary predicate. In this expanded language, ultrahomogeneous vertex 2-colorings of ultrahomogeneous graphs are classified.
Citation
J. E. Helmreich. "Expansions of Ultrahomogeneous Graphs." Notre Dame J. Formal Logic 36 (3) 414 - 424, Summer 1995. https://doi.org/10.1305/ndjfl/1040149357
Information