{"product_id":"9789819647477","title":"Maximal Planar Graph Theory and the Four-Color Conjecture","description":"\u003ch1\u003eMaximal Planar Graph Theory and the Four-Color Conjecture\u003c\/h1\u003e\u003ch3\u003eJin Xu\u003c\/h3\u003e\u003cdiv\u003e\u003cb\u003eComputers \/ Computer Science\u003c\/b\u003e\u003c\/div\u003e\u003cbr\u003e\u003cdiv\u003e\n\u003cp class=\"MsoNormal\"\u003e\u003cspan style=\"font-size: 11.0pt; font-family: 'Calibri',sans-serif; mso-fareast-font-family: SimSun; color: black; mso-font-kerning: 0pt;\"\u003eThis open access book integrates foundational principles with advanced methodologies concerning maximal planar graphs. It offers readers an exceptional examination of graph structures, chromatic polynomials, and the construction and proof techniques of\u003c\/span\u003e \u003cspan style=\"font-size: 11.0pt; font-family: 'Calibri',sans-serif; mso-fareast-font-family: SimSun; color: black; mso-font-kerning: 0pt;\"\u003ethe Four-Color Conjecture. It is tailored for researchers, educators, and students involved in graph theory, combinatorics, and computational mathematics. \u003c\/span\u003e\u003c\/p\u003e\r\n\u003cp class=\"MsoNormal\"\u003e\u003cspan style=\"font-size: 11.0pt; font-family: 'Calibri',sans-serif; mso-fareast-font-family: SimSun; color: black; mso-font-kerning: 0pt;\"\u003eThe book consists of nine meticulously developed chapters. It starts with fundamental concepts in graph theory and then advances to pioneering computational proofs and recursive formulas of the chromatic number related to maximal planar graphs. Notable features include comprehensive discharging techniques, innovative approaches for constructing graphs of various orders, and groundbreaking conjectures concerning tree-colorability and unique four-colorability. The concluding chapter introduces Kempe's\u003c\/span\u003e \u003cspan style=\"font-size: 11.0pt; font-family: 'Calibri',sans-serif; mso-fareast-font-family: SimSun; color: black; mso-font-kerning: 0pt;\"\u003echanges, offering new insights into the dynamics of graph coloring.\u003c\/span\u003e\u003c\/p\u003e\r\n\u003cp class=\"MsoNormal\"\u003e\u003cspan style=\"font-size: 11.0pt; font-family: 'Calibri',sans-serif; mso-fareast-font-family: SimSun; color: black; mso-font-kerning: 0pt;\"\u003eWhether you are an academic enhancing your theoretical knowledge or a student searching for\u003c\/span\u003e \u003cspan style=\"font-size: 11.0pt; font-family: 'Calibri',sans-serif; mso-fareast-font-family: SimSun; color: black; mso-font-kerning: 0pt;\"\u003eclear explanations for complex concepts, this book provides essential tools for navigating and addressing some of the most intricate challenges in graph theory. Its rigorous analysis and computational techniques equip readers with the necessary skills to engage deeply with maximal planar graph problems, making it an indispensable resource for advancing research and practical applications.\u003c\/span\u003e\u003c\/p\u003e\r\n\u003cp class=\"MsoNormal\"\u003e\u003cspan style=\"font-size: 11.0pt; font-family: 'Calibri',sans-serif; mso-fareast-font-family: SimSun; color: black; mso-font-kerning: 0pt;\"\u003eNo prior knowledge is necessary; however, a foundational understanding of graph theory is advised. This opportunity presents a chance to explore innovative perspectives and methodologies that expand the horizons of mathematical inquiry and proof development.\u003c\/span\u003e\u003c\/p\u003e\n\u003c\/div\u003e\u003cdiv\u003e\n\u003cp class=\"MsoNormal\"\u003e\u003cspan style=\"font-size: 11.0pt; font-family: 'Calibri',sans-serif; mso-fareast-font-family: SimSun; color: black; mso-font-kerning: 0pt;\"\u003eJin Xu is a tenured professor and PhD supervisor at Peking University, holding dual doctorates in science and engineering. With over thirty years\u003c\/span\u003e \u003cspan style=\"font-size: 11.0pt; font-family: 'Calibri',sans-serif; mso-fareast-font-family: SimSun; color: black; mso-font-kerning: 0pt;\"\u003eof academic and research experience, Dr. Xu specializes in graph theory, biological computing, and neural networks—fields directly tied to the themes explored in this book.\u003c\/span\u003e\u003c\/p\u003e\r\n\u003cp class=\"MsoNormal\"\u003e\u003cspan style=\"font-size: 11.0pt; font-family: 'Calibri',sans-serif; mso-fareast-font-family: SimSun; color: black; mso-font-kerning: 0pt;\"\u003eAn accomplished scholar, Dr. Xu has authored over\u003c\/span\u003e \u003cspan style=\"font-size: 11.0pt; font-family: 'Calibri',sans-serif; mso-fareast-font-family: SimSun; color: black; mso-font-kerning: 0pt;\"\u003e200 SCI-indexed papers as the first or corresponding author and led ten prestigious national research projects, including the NSFC, ‘973,’ and ‘863’ initiatives. His groundbreaking work has earned the Second Prize in the National Natural Science Award and multiple First Prizes in the Natural Science Awards from the Ministry of Education and Hubei Province.\u003c\/span\u003e\u003c\/p\u003e\n\u003c\/div\u003e\u003cbr\u003e\u003ctable\u003e\n\u003ctr\u003e\n\u003ctd\u003ePublication Date: \u003c\/td\u003e\n\u003ctd\u003e25 May 2026\u003c\/td\u003e\n\u003c\/tr\u003e\n\u003ctr\u003e\n\u003ctd\u003ePublisher: \u003c\/td\u003e\n\u003ctd\u003eJin Xu\u003c\/td\u003e\n\u003c\/tr\u003e\n\u003ctr\u003e\n\u003ctd\u003eImprint: \u003c\/td\u003e\n\u003ctd\u003eSpringer\u003c\/td\u003e\n\u003c\/tr\u003e\n\u003ctr\u003e\n\u003ctd\u003eISBN-13: \u003c\/td\u003e\n\u003ctd\u003e9789819647477\u003c\/td\u003e\n\u003c\/tr\u003e\n\u003ctr\u003e\n\u003ctd\u003eFormat: \u003c\/td\u003e\n\u003ctd\u003ePaperback softback\u003c\/td\u003e\n\u003c\/tr\u003e\n\u003ctr\u003e\n\u003ctd\u003ePage Count: \u003c\/td\u003e\n\u003ctd\u003e232\u003c\/td\u003e\n\u003c\/tr\u003e\n\u003c\/table\u003e","brand":"Jin Xu","offers":[{"title":"Default Title","offer_id":53331581698188,"sku":"9789819647477","price":44.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9789819647477.jpg?v=1787252401","url":"https:\/\/lateknightbooks.com\/products\/9789819647477","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}