Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 16 of 16 for “"Four Color Theorem"”.
-
Four Color Theorem
The Four Color Theorem originated in 1850 and was not solved in its entirety until 1976. This report details the history of the proof for the Four Color Theorem and multiple contributions to the proof of the Four Color Theorem by several mathematicians. Ideas such as Kempe Chains, reducibility, …
-
The Four Color Theorem: A Possible New Approach
… of this thesis is to explore the topic of graph coloring and expand on existing ideas in the field of Graph Theory. These developments will then be used to provide a possible approach in proving the 4 – color theorem that was made famous by Guthrie in the 1800’s. Since the theorem was presented, …
-
Keturių spalvų teorema /
The Four Color Theorem.
-
Formalisering av algoritmer och matematiska bevis En formalisering av Toom-Cook algoritmen i Coq med SSReflect
… and complex proofs such as the proof of the Four color theorem and the Feit-Thompson theorem. In this report we present a formal proof of the Toom-Cook algorithm using the Coq proof assistant together with the SSReflect extension. The Toom-Cook algorithm is used to multiply polynomials and …
-
6-connected graphs are two-three linked
… vertices of $G$. Motivated by their work on Four Color Theorem, Hadwiger's conjecture for $K_6$, and J\o rgensen's conjecture, Robertson and Seymour asked when does $G$ contain disjoint connected subgraphs $G_1, G_2$, such that $\{a_0, a_1, a_2\}\subseteq V(G_1)$ and $\{b_1, b_2\}\subseteq …
-
Coloring graphs with no k5-subdivision: disjoint paths in graphs
The Four Color Theorem states that every planar graph is 4-colorable. Hajos conjectured that for any positive integer k, every graph containing no K_{k+1}-subdivision is k-colorable. However, Catlin disproved Hajos conjecture for k>=6. It is not hard to prove that the conjecture is true for k<=3. …
-
Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles
The famous Four Color Theorem states that any planar graph can be properly colored using at most four colors. However, if we want to properly color the square of a planar graph (or alternatively, color the graph using distinct colors on vertices at distance up to two from each other), we will …
-
Planar graphs : a historical perspective.
… IV is the history and eventual "proof" of the four-color theorem, although it also includes a discussion of generalizations involving coloring maps on surfaces of higher genus. The final chapter gives a number of measurements of a graph's closeness to planarity, including the concepts of …
-
Investigating abelian categories in univalent type theory
… computer checked proof was made to prove the four color theorem. This raised questions about how these computations should be interpreted to create a formal proof, as well as the validity of the proof given. In 2005 the proof was recreated in the proof assistant Coq, both showing the structure …
-
On mitigating distributed denial of service attacks
… proposed DDoS defense mechanisms, including the four-color-theorem based path marking, and a comprehensive framework for DDoS defense. The salient features of the framework include (1) it is designed to tackle a wide spectrum of DDoS attacks rather than a specified one, and (2) it can …
-
A Historical Approach to Understanding Explanatory Proofs Based on Mathematical Practices
… explanatory proofs. Here, I suggest looking at a theorem’s history, which includes its successive proofs, as well as the mathematicians who wrote them. From this, we can better understand how and why mathematicians prove theorems in multiple ways, which depends on the purposes of these theorems. …
-
Hadwiger Numbers and Gallai-Ramsey Numbers of Special Graphs
… first study a far-reaching generalization of the Four Color Theorem. Given a graph G, we use chi(G) to denote the chromatic number; alpha(G) the independence number; and h(G) the Hadwiger number, which is the largest integer t such that the complete graph K_t can be obtained from a subgraph of G …
-
Integer Flows and Circuit Covers of Graphs and Signed Graphs
… of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it contains an even factor H …
-
Flows on Signed Graphs
… flows, which serves as a dual problem to vertex coloring of planar graphs, was initially introduced by Tutte as a tool related to the Four-Color Theorem. This theory has been extended to signed graphs. In 1983, Bouchet proposed a conjecture asserting that every flow-admissible signed graph admits …