New Proof of 4-Colourability of a Class of Graphs

Jump To References Section

Authors

  • M. N. Vartak
  • H. Narayanan

Abstract

The Following result about planar trivalent (homogeneous of degree 3) graphs is well known. [[1], p. 121].

THEOREM A: A planar trivalent graph is face colourable in four colours if and only if it contains a partial graph H, which is homogeneous of degree 2 and has even number of edges in each component of H (A partial graph being a subgraph containing all the vertices).

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Downloads

Published

1974-12-01

How to Cite

Vartak, M. N., & Narayanan, H. (1974). New Proof of 4-Colourability of a Class of Graphs. The Journal of the Indian Mathematical Society, 38(1-4), 201–205. Retrieved from https://www.informaticsjournals.com/index.php/jims/article/view/16692

Issue

Volume 38, Issue 1-4, March-December 1974

Section

Articles

License

Copyright (c) 1974 M. N. Vartak, H. Narayanan

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

 

References

R. G. BUSACKER AND T. L. SAATY, Finite Graphs and Networks, McGraw Hill.

OYSTEIN ORE, The Four Colour Problem, Academic Press.