東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Linked to FindBook

Google Book

Amazon

博客來

Maximal planar graph theory and the four-color conjecture

Record Type:	Electronic resources : Monograph/item
Title/Author:	Maximal planar graph theory and the four-color conjecture/ by Jin Xu.
Author:	Xu, Xiangmin.
Published:	Singapore :Springer Nature Singapore : : 2025.,
Description:	xiv, 232 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	Chapter 1 Graph Theory Fundamentals -- Chapter 2 Discharging and Structure of Maximal Planar Graphs -- Chapter 3 Computer-Based Proofs of Four Color Conjecture -- Chapter 4 Construction of Maximal Planar Graphs with the same order -- Chapter 5 Construction of Maximal Planar Graphs with the different order -- Chapter 6 Generating System of Maximal Planar Graphs -- Chapter 7 Recursion Formulae of Chromatic Polynomial and Four-Color Conjecture -- Chapter 8 Purely Tree-colorable and Uniquely 4-Colorable Maximal Planar Graph Conjectures -- Chapter 9 Kempe Change.
Contained By:	Springer Nature eBook
Subject:	Graph coloring. -
Online resource:	https://doi.org/10.1007/978-981-96-4745-3
ISBN:	9789819647453

Maximal planar graph theory and the four-color conjecture
Xu, Xiangmin.

Maximal planar graph theory and the four-color conjecture[electronic resource] /by Jin Xu. - Singapore :Springer Nature Singapore :2025. - xiv, 232 p. :ill. (some col.), digital ;24 cm.

Chapter 1 Graph Theory Fundamentals -- Chapter 2 Discharging and Structure of Maximal Planar Graphs -- Chapter 3 Computer-Based Proofs of Four Color Conjecture -- Chapter 4 Construction of Maximal Planar Graphs with the same order -- Chapter 5 Construction of Maximal Planar Graphs with the different order -- Chapter 6 Generating System of Maximal Planar Graphs -- Chapter 7 Recursion Formulae of Chromatic Polynomial and Four-Color Conjecture -- Chapter 8 Purely Tree-colorable and Uniquely 4-Colorable Maximal Planar Graph Conjectures -- Chapter 9 Kempe Change.

Open access.

This 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 the Four-Color Conjecture. It is tailored for researchers, educators, and students involved in graph theory, combinatorics, and computational mathematics. The 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 changes, offering new insights into the dynamics of graph coloring. Whether you are an academic enhancing your theoretical knowledge or a student searching for clear 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. No 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.

ISBN: 9789819647453

Standard No.: 10.1007/978-981-96-4745-3doiSubjects--Topical Terms:

1041590
Graph coloring.

LC Class. No.: QA166.247

Dewey Class. No.: 511.56

Maximal planar graph theory and the four-color conjecture
LDR:03292nmm a2200337 a 4500 001 2409756
003 DE-He213
005 20250523130242.0
006 m d
007 cr nn 008maaau
008 260204s2025 si s 0 eng d
020 $a 9789819647453 $q (electronic bk.)
020 $a 9789819647446 $q (paper)
024 7 $a 10.1007/978-981-96-4745-3 $2 doi
035 $a 978-981-96-4745-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166.247
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 511.56 $2 23
090 $a QA166.247 $b .X8 2025
100 1 $a Xu, Xiangmin. $3 3783154
245 1 0 $a Maximal planar graph theory and the four-color conjecture $h [electronic resource] / $c by Jin Xu.
260 $a Singapore : $b Springer Nature Singapore : $b Imprint: Springer, $c 2025.
300 $a xiv, 232 p. : $b ill. (some col.), digital ; $c 24 cm.
505 0 $a Chapter 1 Graph Theory Fundamentals -- Chapter 2 Discharging and Structure of Maximal Planar Graphs -- Chapter 3 Computer-Based Proofs of Four Color Conjecture -- Chapter 4 Construction of Maximal Planar Graphs with the same order -- Chapter 5 Construction of Maximal Planar Graphs with the different order -- Chapter 6 Generating System of Maximal Planar Graphs -- Chapter 7 Recursion Formulae of Chromatic Polynomial and Four-Color Conjecture -- Chapter 8 Purely Tree-colorable and Uniquely 4-Colorable Maximal Planar Graph Conjectures -- Chapter 9 Kempe Change.
506 $a Open access.
520 $a This 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 the Four-Color Conjecture. It is tailored for researchers, educators, and students involved in graph theory, combinatorics, and computational mathematics. The 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 changes, offering new insights into the dynamics of graph coloring. Whether you are an academic enhancing your theoretical knowledge or a student searching for clear 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. No 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.
650 0 $a Graph coloring. $3 1041590
650 1 4 $a Computational Geometry. $3 3603999
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-981-96-4745-3
950 $a Computer Science (SpringerNature-11645)