東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Linked to FindBook

Google Book

Amazon

博客來

Graph minors = theory and applications /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Graph minors/ by Zdeněk Dvořák.
Reminder of title:	theory and applications /
Author:	Dvořák, Zdeněk.
Published:	Cham :Springer Nature Switzerland : : 2025.,
Description:	xiv, 383 p. :ill., digital ;24 cm.
[NT 15003449]:	Chapter 1. Introduction -- Part I. Understanding the structure theorem -- Chapter 2. Tree decompositions and treewidth -- Chapter 3. Linkedness -- Chapter 4. Graphs on surfaces -- Chapter 5. Towards the structure theorem -- Chapter 6. Pointers and sources -- Part II. Using the structure theorem -- Chapter 7. Low-treewidth colorings -- Chapter 8. Tighter grid theorem -- Chapter 9. Topological minors -- Chapter 10. Minors in large connected graphs -- Chapter 11. Sources -- Part III. Avoiding the structure theorem -- Chapter 12. Sublinear separators -- Chapter 13. Chordal partitions -- Chapter 14. Chromatic number -- Chapter 15. Product structure -- Chapter 16. Iterated layerings -- Chapter 17. Isomorphism testing -- Chapter 18. Sources.
Contained By:	Springer Nature eBook
Subject:	Graph theory. -
Online resource:	https://doi.org/10.1007/978-3-031-87469-7
ISBN:	9783031874697

Graph minors = theory and applications /
Dvořák, Zdeněk.

Graph minorstheory and applications /[electronic resource] :by Zdeněk Dvořák. - Cham :Springer Nature Switzerland :2025. - xiv, 383 p. :ill., digital ;24 cm. - Springer monographs in mathematics,2196-9922. - Springer monographs in mathematics..

Chapter 1. Introduction -- Part I. Understanding the structure theorem -- Chapter 2. Tree decompositions and treewidth -- Chapter 3. Linkedness -- Chapter 4. Graphs on surfaces -- Chapter 5. Towards the structure theorem -- Chapter 6. Pointers and sources -- Part II. Using the structure theorem -- Chapter 7. Low-treewidth colorings -- Chapter 8. Tighter grid theorem -- Chapter 9. Topological minors -- Chapter 10. Minors in large connected graphs -- Chapter 11. Sources -- Part III. Avoiding the structure theorem -- Chapter 12. Sublinear separators -- Chapter 13. Chordal partitions -- Chapter 14. Chromatic number -- Chapter 15. Product structure -- Chapter 16. Iterated layerings -- Chapter 17. Isomorphism testing -- Chapter 18. Sources.

Graph minor theory is one of the most influential and well-developed areas of graph theory, yet its key results, particularly the work of Robertson and Seymour, have remained scattered across numerous technical papers. This book fills an important gap by providing a comprehensive, structured treatment of the subject. Divided into three main parts, the book first introduces the fundamentals of graph minor theory, focusing on the deep and powerful Minor Structure Theorem. It offers a clear roadmap for understanding the theorem's proof, presenting its key ingredients while omitting only the most technical details. The second part explores a variety of applications, from algorithmic results to connections with the Linear Hadwiger Conjecture and graph coloring problems. The final section presents alternative approaches to graph minor theory that do not rely on the Minor Structure Theorem, covering topics such as sublinear separators, density, and isomorphism testing. The exposition is rigorous yet accessible, striving to balance depth with readability. While some parts remain dense due to the complexity of the subject, the author provides valuable insights and explanations that make challenging concepts more approachable. The book not only serves as an excellent learning resource for graduate students and researchers entering the field but also as a long-lasting reference for experts.

ISBN: 9783031874697

Standard No.: 10.1007/978-3-031-87469-7doiSubjects--Topical Terms:

523815
Graph theory.

LC Class. No.: QA166 / .D86 2025

Dewey Class. No.: 511.5

Graph minors = theory and applications /
LDR:03177nmm a2200337 a 4500 001 2414920
003 DE-He213
005 20250930143915.0
006 m d
007 cr nn 008maaau
008 260205s2025 sz s 0 eng d
020 $a 9783031874697 $q (electronic bk.)
020 $a 9783031874680 $q (paper)
024 7 $a 10.1007/978-3-031-87469-7 $2 doi
035 $a 978-3-031-87469-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166 $b .D86 2025
072 7 $a PBV $2 bicssc
072 7 $a MAT008000 $2 bisacsh
072 7 $a PBV $2 thema
082 0 4 $a 511.5 $2 23
090 $a QA166 $b .D988 2025
100 1 $a Dvořák, Zdeněk. $3 3791945
245 1 0 $a Graph minors $h [electronic resource] : $b theory and applications / $c by Zdeněk Dvořák.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xiv, 383 p. : $b ill., digital ; $c 24 cm.
490 1 $a Springer monographs in mathematics, $x 2196-9922
505 0 $a Chapter 1. Introduction -- Part I. Understanding the structure theorem -- Chapter 2. Tree decompositions and treewidth -- Chapter 3. Linkedness -- Chapter 4. Graphs on surfaces -- Chapter 5. Towards the structure theorem -- Chapter 6. Pointers and sources -- Part II. Using the structure theorem -- Chapter 7. Low-treewidth colorings -- Chapter 8. Tighter grid theorem -- Chapter 9. Topological minors -- Chapter 10. Minors in large connected graphs -- Chapter 11. Sources -- Part III. Avoiding the structure theorem -- Chapter 12. Sublinear separators -- Chapter 13. Chordal partitions -- Chapter 14. Chromatic number -- Chapter 15. Product structure -- Chapter 16. Iterated layerings -- Chapter 17. Isomorphism testing -- Chapter 18. Sources.
520 $a Graph minor theory is one of the most influential and well-developed areas of graph theory, yet its key results, particularly the work of Robertson and Seymour, have remained scattered across numerous technical papers. This book fills an important gap by providing a comprehensive, structured treatment of the subject. Divided into three main parts, the book first introduces the fundamentals of graph minor theory, focusing on the deep and powerful Minor Structure Theorem. It offers a clear roadmap for understanding the theorem's proof, presenting its key ingredients while omitting only the most technical details. The second part explores a variety of applications, from algorithmic results to connections with the Linear Hadwiger Conjecture and graph coloring problems. The final section presents alternative approaches to graph minor theory that do not rely on the Minor Structure Theorem, covering topics such as sublinear separators, density, and isomorphism testing. The exposition is rigorous yet accessible, striving to balance depth with readability. While some parts remain dense due to the complexity of the subject, the author provides valuable insights and explanations that make challenging concepts more approachable. The book not only serves as an excellent learning resource for graduate students and researchers entering the field but also as a long-lasting reference for experts.
650 0 $a Graph theory. $3 523815
650 1 4 $a Graph Theory. $3 1567033
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Springer monographs in mathematics. $3 1535313
856 4 0 $u https://doi.org/10.1007/978-3-031-87469-7
950 $a Mathematics and Statistics (SpringerNature-11649)