Discrete Math - Going over the 10.5 HW on Graph Theory

Discrete Math - Rose - MBHS - Blair - Going over the 10.5 HW on Graph Theory -p. 638 # 3, 5, 6, 7 [on Planarity & Kuratowski's Theorem] & p. 638 # 9, 10, 11, 12, 15, 18 [on Duality and Chromatic Numbering] - 05/22/2021

Пікірлер: 3

  • @dodecahedra
    @dodecahedra Жыл бұрын

    @36:16 This graph can be colored with just three colors! I was just too dumb to figure it out. Moral of the story... we should probably develop some algorithms for this.

  • @felslayer2750
    @felslayer27502 жыл бұрын

    Hey! This video really helped me! -Neel Jay

  • @dodecahedra
    @dodecahedra Жыл бұрын

    @32:17 Our author, Eric Gossett, defines W₅ as the wheel graph with 5 vertices, so that top graph is W₅ and the bottom graph is W₆. So using this notation Χ(Wₙ) = 3 if n is odd, and Χ(Wₙ) = 4 if n is even, contrary to what was said in the video.