Cite
HARVARD Citation
Jaffke, L. et al. (2017). Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. European journal of combinatorics. pp. 191-234. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Jaffke, L. et al. (2017). Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. European journal of combinatorics. pp. 191-234. [Online].