Bruno Courcelle - The monadic second-order logic of graphs XVI : Canonical graph<br> decompositions

lmcs:2250 - Logical Methods in Computer Science, March 23, 2006, Volume 2, Issue 2 - https://doi.org/10.2168/LMCS-2(2:2)2006
The monadic second-order logic of graphs XVI : Canonical graph<br> decompositionsArticle

Authors: Bruno Courcelle

    This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more general result covering canonical graph decompositions like the modular decomposition and the Tutte decomposition of 2-connected graphs into 3-connected components. As an application, we prove that the set of graphs having the same cycle matroid as a given 2-connected graph can be defined from this graph by Monadic Second-Order formulas.

    https://doi.org/10.2168/LMCS-2(2:2)2006
    Source: arXiv.org:cs/0510066
    Volume: Volume 2, Issue 2
    Published on: March 23, 2006
    Submitted on: June 24, 2005
    Keywords: Computer Science - Logic in Computer Science,F.4.1
    Licence: arXiv.org - Assumed non-exclusive license to distribute

    15 Documents citing this article

    Share and export

    Consultation statistics

    This page has been seen 1585 times.
    This article's PDF has been downloaded 609 times.