Published in

Elsevier, Electronic Notes in Discrete Mathematics, (49), p. 559-568, 2015

DOI: 10.1016/j.endm.2015.06.076

Links

Tools

Export citation

Search in Google Scholar

Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality

Journal article published in 2015 by Hans L. Bodlaender ORCID, Hl Hans Bodlaender, Pinar Heggernes, Jan Arne Telle
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

We prove that every recognizable family of graphs of bounded treewidth and bounded chordality is definable in counting monadic second-order logic.