相关论文: A note on the history of the four-colour conjectur…
A formal proof has not been found for the four color theorem since 1852 when Francis Guthrie first conjectured the four color theorem. Why? A bad idea, we think, directed people to a rough road. Using a similar method to that for the formal…
The famous four color theorem states that for all planar graphs, every vertex can be assigned one of 4 colors such that no two adjacent vertices receive the same color. Since Francis Guthrie first conjectured it in 1852, it is until 1976…
The four-color theorem states that no more than four colors are required to color all nodes in planar graphs such that no two adjacent nodes are of the same color. The theorem was first propounded by Francis Guthrie in 1852. Since then,…
Acceptable but due to extensive usage of a computer rather unpleasant proof of the famous four color map problem of Francis Guthrie were settled eventually by W. Appel and K. Haken in 1976. Using the same method but shortening the proof…
The four-color conjecture has puzzled mathematicians for over 170 years and has yet to be proven by purely mathematical methods. This series of articles provides a purely mathematical proof of the four-color conjecture, consisting of two…
The odd wheel is the only type of 4-critical graph in which one vertex always gets a unique color. This supports Frederic Guthrie's approach to the Four Color Problem.
In 1976, Appel and Haken achieved a major break through by proving the four color theorem $(4CT)$. Their proof is based on studying a large number of cases for which a computer-assisted search for hours is required. In 1997, Robertson,…
Withdrwan by author
There are two conjectures concerning planar graph colourings that are strengthenings of the four colour theorem. One concerns signed graph colouring and is proposed by M\'{a}\v{c}ajov\'{a}, Raspaud and \v{S}koviera. It asserts that every…
We make an attempt at proving the Four Colour Theorem in six pages.
The Four-Vertex Theorem has been of interest ever since a discrete version appeared in 1813 due to Cauchy. Up until now, there have been many different versions of this theorem, both for discrete cases and smooth cases. In 2004, an approach…
The first colours photographs were created by a process introduced by Edmond Becquerel in 1848. The nature of these photochromatic images colours motivated a debate between scientists during the 19th century, which is still not settled. We…
This paper has been withdrawn by the author due to a crucial error in last part of proof.
The total chromatic number conjecture which has appeared in a few hundred articles and in numerous books thus far is now one of the classic mathematical unsolved problems. It appears that many authors coincidentally have attributed it to…
It was conjectured by the third author in about 1973 that every $d$-regular planar graph (possibly with parallel edges) can be $d$-edge-coloured, provided that for every odd set $X$ of vertices, there are at least $d$ edges between $X$ and…
This paper presents a short and simple proof of the Four-Color Theorem that can be utterly checkable by human mathematicians, without computer assistance. The new key idea that has allowed it and the global structure of the proof are…
By starting with the simpliest expression of the first order linear wave equation (Dirac's equation) and by confining the elements of the coefficients (matrices) to the quaternions, it is shown that the association of the imaginary bases of…
The Gasca-Maeztu conjecture for the case $n=4$ was proved for the first time in [J. R. Busch, A note on Lagrange interpolation in $\mathbb{R}^2$, Rev. Un. Mat. Argentina, 36 (1990) 33--38]. Here we bring a short and simple proof of it.
In this paper, we provide an easy proof of the Four-colour Theorem in a special case indeed.
In a simple graph $G$, we prove that the \textit{Hadwiger number}, $h(G)$, of the given graph $G$ always upper bounds the \textit{chromatic number}, $\chi(G)$, of the given graph $G$, that is, $\chi(G) \leq h(G)$. This simply stated problem…