A graph is called "triangle-free" if it does not contain a cycle of length three (a cycle with three edges). Prove that any triangle-free planar graph can be coloured by 4 colours.
Can someone show me how to prove this problem?
A graph is called "triangle-free" if it does not contain a cycle of length three (a cycle with three edges). Prove that any triangle-free planar graph can be coloured by 4 colours.
Can someone show me how to prove this problem?
Copyright © 2021 JogjaFile Inc.