Unformatted text preview: G be Hamiltonian if | E | = 17? You need to justify your conclusions. 3. Prove or disprove: every directed edge in a strongly connected tournament is contained in a directed Hamiltonian cycle. 4. ±ind all 4-regular maximal planar graphs (the following graph, known as the octahedron is such a graph). You need to justify your conclusion. Important —– No Late Homework Will be Accepted —–...
View Full Document
- Spring '08
- Graph Theory, Planar graph, Graph Theory Homework, directed Hamiltonian cycle