Description

Book Synopsis

This groundbreaking, yet accessible book contains original results on the interaction between graph theory and computational complexity using methods from finite model theory. As well as a wealth of new, previously unpublished results, the author also gives an account of the established results in the area.

Trade Review

'The book is divided evenly into two parts. Part I gives background and definitions of the main notions, and makes the book self-contained. Many results from descriptive complexity theory, and the author's earlier results, are clearly presented. Part II is devoted to the main theorem about graphs with excluded minors. The book ends with a symbol index and an index.' Pascal Michel, Mathematical Reviews

Table of Contents

1. Introduction; Part I. The Basic Theory: 2. Background from graph theory and logic; 3. Descriptive complexity; 4. Treelike decompositions; 5. Definable decompositions; 6. Graphs of bounded tree width; 7. Ordered treelike decompositions; 8. 3-Connected components; 9. Graphs embeddable in a surface; Part II. Definable Decompositions of Graphs with Excluded Minors: 10. Quasi-4-connected components; 11. K5-minor free graphs; 12. Completions of pre-decompositions; 13. Almost planar graphs; 14. Almost planar completions; 15. Almost embeddable graphs; 16. Decompositions of almost embeddable graphs; 17. Graphs with excluded minors; 18. Bits and pieces; Appendix. Robertson and Seymour's version of the local structure theorem; References; Symbol index; Index.

Descriptive Complexity Canonisation and Definable Graph Structure Theory 47 Lecture Notes in Logic Series Number 47

    Product form

    A Hardback by Martin Grohe

    £155.00

    Includes FREE delivery

    Order before 4pm today for delivery by Wed 2 Dec 2026.

    15 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Descriptive Complexity Canonisation and Definable Graph Structure Theory 47 Lecture Notes in Logic Series Number 47 by Martin Grohe

      Book details

      Published 17 August 2017
      ISBN-13 9781107014527
      978-1107014527
      ISBN-10 1107014522

      Description

      Book Synopsis

      This groundbreaking, yet accessible book contains original results on the interaction between graph theory and computational complexity using methods from finite model theory. As well as a wealth of new, previously unpublished results, the author also gives an account of the established results in the area.

      Trade Review

      'The book is divided evenly into two parts. Part I gives background and definitions of the main notions, and makes the book self-contained. Many results from descriptive complexity theory, and the author's earlier results, are clearly presented. Part II is devoted to the main theorem about graphs with excluded minors. The book ends with a symbol index and an index.' Pascal Michel, Mathematical Reviews

      Table of Contents

      1. Introduction; Part I. The Basic Theory: 2. Background from graph theory and logic; 3. Descriptive complexity; 4. Treelike decompositions; 5. Definable decompositions; 6. Graphs of bounded tree width; 7. Ordered treelike decompositions; 8. 3-Connected components; 9. Graphs embeddable in a surface; Part II. Definable Decompositions of Graphs with Excluded Minors: 10. Quasi-4-connected components; 11. K5-minor free graphs; 12. Completions of pre-decompositions; 13. Almost planar graphs; 14. Almost planar completions; 15. Almost embeddable graphs; 16. Decompositions of almost embeddable graphs; 17. Graphs with excluded minors; 18. Bits and pieces; Appendix. Robertson and Seymour's version of the local structure theorem; References; Symbol index; Index.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account