ON PLANAR COLOURED GRAPHS

Authors

  • S.Satyanarayana Department of Mathematics, Sri Venkateswara Institute Of Science &Information Technology,Tadepalligudm Author
  • Dr. J.Venkateswara Rao Professor & Principl, Siddharth Institute of P.G.Studies, Kantepudi (V), Sattenapalli (M), Guntur (Dt.) (A.P.) INDIA Author

DOI:

https://doi.org/10.70153/

Keywords:

Planar graph, near-triangulation, vertex coloring, chromatic number, 4-Colourable

Abstract

In this paper we will work two proofs of the 4-Colour Theorem are presented which do not require the use of Computer Programs

Downloads

Published

2009-07-31

Most read articles by the same author(s)

Similar Articles

You may also start an advanced similarity search for this article.