The First Order Theory of N-Colorable Graphs

DOI10.2307/1998992MaRDI QIDQ3864495zbMATH OpenOpenAlexFDO

Authors 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 companionN-colorable graphrecursive axiomatization

Mathematics Subject Classification ID

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

Cited in

(6)

• Subdirect decomposition of \(n\)-chromatic graphs
• Homomorphisms and amalgamation
• Finitely axiomatizable quasivarieties of graphs
• The computational complexity of deciding whether a finite algebra generates a minimal variety
• Recursive axiomatisations from separation properties
• Flexible constraint satisfiability and a problem in semigroup theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3864495)