Torrent details for "Dvorak Z. Graph Minors. Theory and Applications 2025" Log in to bookmark
Controls:
×
Report Torrent
Please select a reason for reporting this torrent:
Your report will be reviewed by our moderation team.
×
Report Information
Loading report information...
This torrent has been reported 0 times.
Report Summary:
| User | Reason | Date |
|---|
Failed to load report information.
×
Success
Your report has been submitted successfully.
Checked by:
Category:
Language:
None
Total Size:
12.1 MB
Info Hash:
B81461775F6F61DF34FEBD4F7CFCF4B8EC0A5437
Added By:
Added:
March 1, 2026, 8:15 a.m.
Stats:
|
(Last updated: March 1, 2026, 8:16 a.m.)
| File | Size |
|---|---|
| Dvorak Z. Graph Minors. Theory and Applications 2025.pdf | 12.1 MB |
Name
DL
Uploader
Size
S/L
Added
NOTE
SOURCE: Dvorak Z. Graph Minors. Theory and Applications 2025
-----------------------------------------------------------------------------------
COVER
-----------------------------------------------------------------------------------
MEDIAINFO
Textbook in PDF format Preface References Declarations Introduction Notation Minors: Definitions and Basic Results References Understanding the Structure Theorem Tree Decompositions and Treewidth The Basic Concepts Statement of the Minor Structure Theorem Treewidth Balanced Separators and Unbreakable Sets Tangles Brambles Grid Minors and Walls Which Obstruction Is the Best One? Operations on Tangles, Rank, and Freedom Pregrids Cleaning Up Path Systems Building the Base Constructing the Grid Erdős–Pósa for Planar Minors Treewidth in Graphs on Surfaces Respectful Tangles Slopes Pretangles and Slopes Tangles and Slopes Branch Decompositions and Related Parameters Pathwidth References References Linkedness Exploiting a Clique Minor Linkedness in Graphs of High Connectivity Unique Linkage Theorem Linked Tree Decompositions References Graphs on Surfaces Linkage Across a Disk or Cylinder Metric from Respectful Tangles The Definition of the Metric The Structure of Balls Clearing a Zone Linking Through a Cylindrical Grid Linking Across a Surface Constructions of Minors References Disjoint Crossed Paths Flat Wall Theorem Testing the Presence of a Minor Structure Around a Crossing Local Form of the Minor Structure Theorem Arranging a Graph on a Surface Finishing the Proof References Pointers and Sources Sources References Using the Structure Theorem Low-Treewidth Colorings Treewidth-Fragility of Minor-Closed Classes Applications of Treewidth-Fragility Approximation of the Chromatic Number Degeneracy-Treewidth Partitioning References Linear-Sized Grid Minors Linear-Sized Grid Contractions References Topological Minors Untangling the Cuts Structure in Minor-Free Graphs Dealing with a Clique Minor Local to Global References Minors in Large Connected Graphs Localizing Apices Taming Vortices From Vortical Decompositions to Strong Vortical Decompositions Guardrails Around a Vortex Enlarging a Vortex Establishing a Linkage Improved Structure Theorem Finding Large Bipartite Minors Coloring Kt-Minor-Free Graphs References Sources References Avoiding the Structure Theorem References Sublinear Separators Existence of Small Separators Applications References Chordal Partitions Fractional Chromatic Number Degeneracy and Its Generalizations References Chromatic Number Density Beyond the Density Relaxed Colorings References Product Structure Product Structure in Graphs on Surfaces Beyond Embedded Graphs Applications References Iterated BFS Layerings Baker-amenable Classes References Isomorphism Testing Weisfeiler-Lehman Algorithm Small Cuts from Stable Colorings Handling the Small Cuts Group Theoretic Ingredients Isomorphism Testing References References Name Index Index
×