Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Electron. Notes Discret. Math.

• Publication date

  2015-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.endm.2015.06.076
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs

  2015cited by this paper
• Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach

  2012cited by this paper
• Graph Structure and Monadic Second-order Logic, a Language Theoretic Approach

  2011cited by this paper
• Chapter 3 - Perfect graphs

  2004cited by this paper
• Definability Equals Recognizability of Partial 3-Trees and \sl k -Connected Partial \sl k -Trees

  2000cited by this paper
• Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width

  1998cited by this paper
• Recognizability Equals Definability for Partial k-Paths

  1997cited by this paper
• The Monadic Second-Order Logic of Graphs VIII: Orientations

  1995cited by this paper
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families

  1992cited by this paper
• The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability

  1991cited by this paper
• The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs

  1990influential reference
• Algorithmic graph theory and perfect graphs

  1986cited by this paper
• Weak Second‐Order Arithmetic and Finite Automata

  1960cited by this paper

• Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees

  2017cites this paper
• Definability equals recognizability for graphs of bounded treewidth *

  2016cites this paper
• Causality in Bounded Petri Nets is MSO Definable

  2016cites this paper
• Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity

  2016cites this paper
• Definability Equals Recognizability for $k$-Outerplanar Graphs

  2015cites this paper
• Recognizability Equals Definability for k-Outerplanar Graphs

  2015cites this paper