𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Groups, graphs, languages, automata, games and second-order monadic logic

✍ Scribed by Tullio Ceccherini-Silberstein; Michel Coornaert; Francesca Fiorenzi; Paul E. Schupp

Book ID
113582486
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
647 KB
Volume
33
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Circle graphs and monadic second-order l
Circle graphs and monadic second-order logic
✍ Bruno Courcelle πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 357 KB

This article is part of a project consisting in expressing, whenever possible, graph properties and graph transformations in monadic second-order logic or in its extensions using modulo p cardinality set predicates or auxiliary linear orders. A circle graph is the intersection graph of a set of chor

The monadic second-order logic of graphs
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
✍ Bruno Courcelle πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 342 KB

We consider the class US k of uniformly k-sparse simple graphs, i.e., the class of ΓΏnite or countable simple graphs, every ΓΏnite subgraph of which has a number of edges bounded by k times the number of vertices. We prove that for each k, every monadic second-order formula (intended to express a grap