The modular decomposition of countable graphs : Definition and construction in monadic second-order logic - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2008

The modular decomposition of countable graphs : Definition and construction in monadic second-order logic

Résumé

We consider the notion of modular decomposition for countable graphs. The modular decomposition of a graph given with an enumeration of its set of vertices, can be defined by formulas of Monadic Second-Order logic. Another result is the definition of a representation of modular decompositions by low degree relational structures. Such relational structures can also be defined in the considered graph by monadic second-order formulas.
Fichier principal
Vignette du fichier
BC-CD-ModularDec.pdf (495.66 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00288222 , version 1 (16-06-2008)

Identifiants

  • HAL Id : hal-00288222 , version 1

Citer

Bruno Courcelle, Christian Delhommé. The modular decomposition of countable graphs : Definition and construction in monadic second-order logic. Theoretical Computer Science, 2008, 394, pp.1-38. ⟨hal-00288222⟩
142 Consultations
227 Téléchargements

Partager

Gmail Facebook X LinkedIn More