The Journal of the Indian Mathematical Society

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

New Proof of 4-Colourability of a Class of Graphs


     

   Subscribe/Renew Journal


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).


Subscription Login to verify subscription
User
Notifications
Font Size


Abstract Views: 161

PDF Views: 0




  • New Proof of 4-Colourability of a Class of Graphs

Abstract Views: 161  |  PDF Views: 0

Authors

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).