Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T08:36:12.323Z Has data issue: false hasContentIssue false

Equivalent definitions of recognizability for sets of graphs of bounded tree-width

Published online by Cambridge University Press:  04 March 2009

Bruno Courcelle
Affiliation:
Université Bordeaux-1, LaBRI, 351 cours de la Libération, 33405 Talence, France Email courcell@labri.u-bordeaux.fr
Jens Lagergren
Affiliation:
Department of Numerical Analysis and Computing Science, The Royal Institute of Technology, S-100 44 Stockholm, Sweden Email jensl@nada.kth.se

Abstract

We show that a set of finite graphs of tree-width at most k is recognizable (with respect to the algebra of graphs with an unbounded number of sources) if and only if it is recognizable with respect to the algebra of graphs of tree-width at most k with at most k sources.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable