7 citations · 19 across the 8 of their papers we have counts for
8 papers
Algorithmic proof of Barnette's Conjecture
I. Cahit
In this paper we have given an algorithmic proof of an long standing Barnette's conjecture (1969) that every 3-connected bipartite cubic planar graph is hamiltonian. Our method is…
A Victorian Age Proof of the Four Color Theorem
I. Cahit
In this paper we have investigated some old issues concerning four color map problem. We have given a general method for constructing counter-examples to Kempe's proof of the four…
On the Three Colorability of Planar Graphs
I. Cahit
The chromatic number of an planar graph is not greater than four and this is known by the famous four color theorem and is equal to two when the planar graph is bipartite. When the…
A Unified Spiral Chain Coloring Algorithm for Planar Graphs
I. Cahit
In this paper we have given a unified graph coloring algorithm for planar graphs. The problems that have been considered in this context respectively, are vertex, edge, total and e…
The proof of Steinberg's three coloring conjecture
I. Cahit
The well-known Steinberg's conjecture asserts that any planar graph without 4- and 5-cycles is 3 colorable. In this note we have given a short algorithmic proof of this conjecture…
Spiral Chains: The Proofs of Tait's and Tutte's Three-Edge-Coloring Conjectures
I. Cahit
In this paper we have shown without assuming the four color theorem of planar graphs that every (bridgeless) cubic planar graph has a three-edge-coloring. This is an old-conjecture…