"Equivalent Definitions of Recognizability for Sets of Graphs of Bounded ..."

Bruno Courcelle, Jens Lagergren (1996)

> Home

Details and statistics

DOI: 10.1017/S096012950000092X

access: closed

type: Journal Article

metadata version: 2020-04-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mscs/CourcelleL96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mscs/CourcelleL96
Bruno Courcelle, Jens Lagergren:
Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width. Math. Struct. Comput. Sci. 6(2): 141-165 (1996)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.