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

Damon Kaller. Definability Equals Recognizability of Partial 3-Trees and k-Connected Partial k-Trees. Algorithmica, 27(3):348-381, 2000. [doi]

Abstract

Abstract is missing.