Computable Categoricity of Graphs with Finite Components
From MaRDI portal
Publication:3507427
DOI10.1007/978-3-540-69407-6_15zbMath1142.03344OpenAlexW1494502516MaRDI QIDQ3507427
Bakhadyr Khoussainov, Jiamou Liu, Barbara F. Csima
Publication date: 19 June 2008
Published in: Logic and Theory of Algorithms (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10292/2811
Related Items (4)
On categoricity spectra for locally finite graphs ⋮ Computable dimension for ordered fields ⋮ Computable isomorphisms for certain classes of infinite graphs ⋮ The complexity of computable categoricity
This page was built for publication: Computable Categoricity of Graphs with Finite Components