Circle graphs and monadic second-order logic
type: Item
instance of: scholarly article
title: Circle graphs and monadic second-order logic
zbMATH Open document ID: 1149.03011
published in: Journal of Applied Logic
publication date: 2008-09-23T00:00:00Z
Mathematics Subject Classification ID: 03B15
Mathematics Subject Classification ID: 05C62
zbMATH DE Number: 5346260
zbMATH Keywords: monadic second-order logic
zbMATH Keywords: split decomposition
zbMATH Keywords: circle graph
zbMATH Keywords: chord diagram
zbMATH Keywords: order-invariant monadic second-order property
zbMATH Keywords: monadic second-order transduction
MaRDI profile type: Publication
full work available at URL: j.jal.2007.05.001
OpenAlex ID: W1975250030
cites work: Euler circuits and DNA sequencing by hybridization
cites work: The interlace polynomial of a graph
cites work: Container ship stowage problem complexity and connection to the coloring of circle graphs
cites work: Reducing prime graphs and recognizing circle graphs
cites work: Circle graph obstructions
cites work: On the Relationship Between Clique-Width and Treewidth
cites work: Monadic second-order definable graph transductions: a survey
cites work: The monadic second-order logic of graphs. VIII: Orientations
cites work: The monadic second-order logic of graphs. X: Linear orderings
cites work: Handbook of Graph Grammars and Computing by Graph Transformation
cites work: The monadic second-order logic of graphs. XII: Planar graphs and planar maps
cites work: The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
cites work: The monadic second-order logic of graphs. XV: On a conjecture by D. Seese
cites work: The monadic second-order logic of graphs XVI : Canonical graph decompositions
cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
cites work: Upper bounds to the clique width of graphs
cites work: Vertex-minors, monadic second-order logic, and a conjecture by Seese
cites work: Decomposition of Directed Graphs
cites work: Generalized Quantifiers and Logical Reducibilities
cites work: Q4255575
cites work: Q5684962
cites work: Recognizing circle graphs in polynomial time
cites work: Algorithmic graph theory and perfect graphs
cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
cites work: Q2766682
cites work: Representations of graphs and networks (coding, layouts and embeddings)
cites work: Elements of finite model theory.
cites work: Algorithmic uses of the Feferman-Vaught theorem
cites work: Q3683903
cites work: Rank-width and vertex-minors
cites work: Recognition of Circle Graphs
cites work: Efficient graph representations
cites work: Theory of Matroids
DOI: 10.1016/J.JAL.2007.05.001
author: Bruno Courcelle
description: scientific article; zbMATH DE number 5346260