The modular decomposition of countable graphs:: Constructions in monadic second-order logic

被引:0
|
作者
Courcelle, B [1 ]
Delhommé, C
机构
[1] Univ Bordeaux 1, CNRS, LaBRI, F-33405 Talence, France
[2] Univ La Reunion, ERMIT, St Denis Messageries, Reunion, France
来源
COMPUTER SCIENCE LOGIC, PROCEEDINGS | 2005年 / 3634卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order logic. A second main result is the definition of a representation of modular decompositions by a low degree relational structures, also constructible by Monadic Second-Order formulas.
引用
收藏
页码:325 / +
页数:2
相关论文
共 50 条