The Library
Logical complexity of graphs : a survey
Tools
Pikhurko, Oleg and Verbitsky, O. (2011) Logical complexity of graphs : a survey. In: Grohe, Martin and Makowsky, Johann A., (eds.) Model theoretic methods in finite combinatorics : AMS-ASL joint special session, January 5-8, 2009, Washington, DC. Contemporary mathematics, Vol.558 . Providence, R.I.: American Mathematical Society, pp. 129-180. ISBN 9780821849439
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://www.ams.org/bookstore?fn=20&arg1=whatsnew&i...
Item Type: | Book Item | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Series Name: | Contemporary mathematics | ||||
Publisher: | American Mathematical Society | ||||
Place of Publication: | Providence, R.I. | ||||
ISBN: | 9780821849439 | ||||
Book Title: | Model theoretic methods in finite combinatorics : AMS-ASL joint special session, January 5-8, 2009, Washington, DC | ||||
Editor: | Grohe, Martin and Makowsky, Johann A. | ||||
Official Date: | 2011 | ||||
Dates: |
|
||||
Volume: | Vol.558 | ||||
Number of Pages: | 519 | ||||
Page Range: | pp. 129-180 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |