The First Order Theory of N-Colorable Graphs

DOI10.2307/1998992zbMath0428.03028OpenAlexW4249881812MaRDI QIDQ3864495

William H. Wheeler

Publication date: 1979

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1998992

zbMATH Keywords

amalgamation basesmodel companionrecursive axiomatizationN-colorable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Models of other mathematical theories (03C65)

Related Items (5)

Finitely axiomatizable quasivarieties of graphs ⋮ The computational complexity of deciding whether a finite algebra generates a minimal variety ⋮ Homomorphisms and amalgamation ⋮ Subdirect decomposition of \(n\)-chromatic graphs ⋮ RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES

This page was built for publication: The First Order Theory of N-Colorable Graphs