This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in t...
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu