The monadic second-order logic of graphs XVI : Canonical graph<br> decompositions
Logic in Computer Science
2017-01-11 v3
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.
Keywords
Cite
@article{arxiv.cs/0510066,
title = {The monadic second-order logic of graphs XVI : Canonical graph<br> decompositions},
author = {Bruno Courcelle},
journal= {arXiv preprint arXiv:cs/0510066},
year = {2017}
}