The monadic second-order logic of graphs XVI: Canonical graph decompositions

15Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Courcelle, B. (2006). The monadic second-order logic of graphs XVI: Canonical graph decompositions. Logical Methods in Computer Science, 2(2). https://doi.org/10.2168/LMCS-2(2:2)2006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free