The monadic second-order logic of graphs
β
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