There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 17

Record: found
Abstract: not found
Article: not found

Complexity of Finding Embeddings in a k-Tree

Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski (1987)

0 comments Cited 177 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Graph minors. V. Excluding a planar graph

Neil Robertson, P.D Seymour (1986)

0 comments Cited 135 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Generalized finite automata theory with an application to a decision problem of second-order logic

J. Thatcher, J B WRIGHT (1968)

0 comments Cited 70 times – based on 0 reviews      Review now

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 1989

Publication date (Online): May 31 2005

Pages: 30-53

DOI: 10.1007/3-540-50728-0_34

SO-VID: 772c7a74-7467-4aa0-a457-5eed2e9ea237

History

Data availability:

The monadic second-order logic of graphs : Definable sets of finite graphs

Read this book at

Related collections

Orbit: A Journal of American Literature

Most cited references 17

Complexity of Finding Embeddings in a k-Tree

Graph minors. V. Excluding a planar graph

Generalized finite automata theory with an application to a decision problem of second-order logic

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 1,146

Cited by 3