Unformatted text preview: 3. Deduce from this that every triangle-free planar graph is 4-colourable. 3. Give a complete list of the connected, planar, self-dual, regular graphs which have at least one edge. 4. Let G be a connected 4-regular planar graph on 10 vertices. What we can say about the face degrees of an embedding of such a graph? Give an example of such a graph. 1...
View Full Document
This note was uploaded on 11/26/2011 for the course MATH 239 taught by Professor M.pei during the Spring '09 term at Waterloo.
- Spring '09