[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-154036-105":59,"doc-detail-154036-en":122},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":115,"head_meta":117,"extra_data":119,"updated_unix":121},105,"en","graph-theory-in-pursuit-evasion-games-table-of-contents","Graph Theory in Pursuit-Evasion Games - Table of Contents","","Structured table of contents for a technical text on graph theory through a sequence of pursuit-evasion game models. Covers foundational concepts such as cops and robbers, graph searching, and graph burning, then expands to localization games, firefighter variants, invisible robber games, and further pursuit-evasion variants. Each chapter includes exercises and projects, alongside key results, bounds, conjectures, and specialized settings like planar graphs, trees, grids, and hypercubes.",{"@graph":69,"@context":114},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":40,"@type":76,"position":81},"https://docshare.wps.com/document/research-report/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/graph-theory-in-pursuit-evasion-games-table-of-contents/154036/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/graph-theory-in-pursuit-evasion-games-table-of-contents/154036.png","ImageObject",300,407,{"name":92,"@type":93},"Đào","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-10-30","2026-08-28",true,{"@type":102,"interactionType":103,"userInteractionCount":44},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108],{"name":109,"@type":110,"acceptedAnswer":111},"Are exercises and projects included throughout the book?","Question",{"text":112,"@type":113},"Yes. Each chapter lists sections for exercises and for projects, extending practice beyond the core theoretical results.","Answer","https://schema.org",{"og:url":83,"og:type":116,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":118,"canonical":83},"index,follow",{"doc_id":120,"site_id":62},154036,1787885080,{"code":4,"msg":5,"data":123},{"doc_id":120,"user_id":124,"nickname":92,"user_avatar":125,"doc_module":4,"category_id":39,"category_name":40,"doc_title":65,"doc_description":67,"doc_content":126,"file_id":127,"file_url":128,"file_type":129,"file_size":130,"view_count":44,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":81,"language":131,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":132,"faqs":133,"seo_title":134,"seo_description":67,"update_tm":121,"read_time":39,"preview_page_count":4},1374402968488,"https://ap-avatar.wpscdn.com/davatar_29158cc5080c5b710cf443261637dec0","Contents  \nList of Figures xi  \nPreface xvii  \nChapter 1 . Introduction 1  \n§1.1 . Introduction to pursuit-evasion games 1  \n§1.2 . Graph theory 6  \n§1.3 . Exercises 13  \nChapter 2 . Cops and Robbers 17  \n§2.1 . Introduction to the game of Cops and Robbers 19  \n§2.2 . The structure of cop-win graphs 23  \n§2.3 . Bounds on the cop number and guarding 28  \n§2.4 . The cop number of planar graphs 35  \n§2.5 . Meyniel's conjecture on the cop number 41  \n§2.6 . Capture time 50  \n§2.7 . Exercises 54  \n§2.8 . Projects 57  \nChapter 3 . Graph Searching 59  \n§3.1 . Introduction to graph searching 59  \n§3.2 . Classes and bounds 64  \n§3.3 . Monotonicity 68  \n§3.4 . Node search and pathwidth 73  \n§3.5 . The search number of trees 80  \n§3.6 . Helicopter Cops and Robbers 84  \n§3.7 . Exercises 87  \n§3.8 . Projects 90  \nChapter 4 . Graph Burning 91  \n§4.1 . Introduction to graph burning 91  \n§4.2 . Burning trees 95  \n§4.3 . The burning number conjecture 100  \n§4.4 . Burning spiders 107  \n§4.5 . Burning graph classes 114  \n§4.6 . Exercises 118  \n§4.7 . Projects 120  \nChapter 5 . The Localization Game 121  \n§5.1 . Introduction to the Localization game 124  \n§5.2 . Localization on bipartite graphs and trees 126  \n§5.3 . Connections with other graph parameters 129  \n§5.4 . Localization on hypercubes 136  \n§5.5 . Localization on graph classes 139  \n§5.6 . Localization capture time 153  \n§5.7 . Exercises 158  \n§5.8 . Projects 161  \nChapter 6 . Fire􀀌ghter 163  \n§6.1 . Introduction to Fire􀀌ghter 163  \n§6.2 . Core results on Fire􀀌ghter 165  \n§6.3 . Fire􀀌ghting on grids 171  \n§6.4 . Surviving rate of a graph 176  \n§6.5 . Exercises 181  \n§6.6 . Projects 183  \nChapter 7 . Invisible Robber Games 185  \n§7.1 . Introduction to invisible robber games 185  \n§7.2 . 0-visibility Cops and Robbers 188  \n§7.3 . Limited-visibility Cops and Robbers 194  \n§7.4 . Hyperopic Cops and Robbers 200  \n§7.5 . Exercises 206  \n§7.6 . Projects 209  \nChapter 8 . Variants of Pursuit-Evasion Games 211  \n§8.1 . Lazy Cops and Robbers 213  \n§8.2 . Cops and Eternal Robbers 216  \n§8.3 . Burning the plane 221  \n§8.4 . Constrained Fire􀀌ghter 224  \n§8.5 . Angel and Devil 227  \n§8.6 . Pursuing the pursuers 230  \n§8.7 . Exercises 234  \n§8.8 . Projects 235  \nBibliography 237  \nIndex 251","cbCainGpn89nmFQp","https://ap.wps.com/l/cbCainGpn89nmFQp","pdf",83894,"English","# Chapter 1. Introduction\n## §1.1 Introduction to pursuit-evasion games\n## §1.2 Graph theory\n## §1.3 Exercises\n# Chapter 2. Cops and Robbers\n## §2.1 Introduction to the game of Cops and Robbers\n## §2.2 The structure of cop-win graphs\n## §2.3 Bounds on the cop number and guarding\n## §2.4 The cop number of planar graphs\n## §2.5 Meyniel's conjecture on the cop number\n## §2.6 Capture time\n## §2.7 Exercises\n## §2.8 Projects\n# Chapter 3. Graph Searching\n## §3.1 Introduction to graph searching\n## §3.2 Classes and bounds\n## §3.3 Monotonicity\n## §3.4 Node search and pathwidth\n## §3.5 The search number of trees\n## §3.6 Helicopter Cops and Robbers\n## §3.7 Exercises\n## §3.8 Projects\n# Chapter 4. Graph Burning\n## §4.1 Introduction to graph burning\n## §4.2 Burning trees\n## §4.3 The burning number conjecture\n## §4.4 Burning spiders\n## §4.5 Burning graph classes\n## §4.6 Exercises\n## §4.7 Projects\n# Chapter 5. The Localization Game\n## §5.1 Introduction to the Localization game\n## §5.2 Localization on bipartite graphs and trees\n## §5.3 Connections with other graph parameters\n## §5.4 Localization on hypercubes\n## §5.5 Localization on graph classes\n## §5.6 Localization capture time\n## §5.7 Exercises\n## §5.8 Projects\n# Chapter 6. Firefighter\n## §6.1 Introduction to Firefighter\n## §6.2 Core results on Firefighter\n## §6.3 Firefighting on grids\n## §6.4 Surviving rate of a graph\n## §6.5 Exercises\n## §6.6 Projects\n# Chapter 7. Invisible Robber Games\n## §7.1 Introduction to invisible robber games\n## §7.2 0-visibility Cops and Robbers\n## §7.3 Limited-visibility Cops and Robbers\n## §7.4 Hyperopic Cops and Robbers\n## §7.5 Exercises\n## §7.6 Projects\n# Chapter 8. Variants of Pursuit-Evasion Games\n## §8.1 Lazy Cops and Robbers\n## §8.2 Cops and Eternal Robbers\n## §8.3 Burning the plane\n## §8.4 Constrained Firefighter\n## §8.5 Angel and Devil\n## §8.6 Pursuing the pursuers\n## §8.7 Exercises\n## §8.8 Projects\n# Bibliography and Index\n## Bibliography\n## Index","[{\"question\":\"Are exercises and projects included throughout the book?\",\"answer\":\"Yes. Each chapter lists sections for exercises and for projects, extending practice beyond the core theoretical results.\"}]","Graph Theory in Pursuit-Evasion Games - Table of Contents | PDF"]