Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Definability Equals Recognizability of Partial 3-Trees and k-Connected ..."

Damon Kaller (2000)

> Home

Details and statistics

DOI: 10.1007/S004530010024

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Kaller00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/Kaller00
Damon Kaller:
Definability Equals Recognizability of Partial 3-Trees and k-Connected Partial k-Trees. Algorithmica 27(3): 348-381 (2000)

a service of

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.