Skip to content
SlayStudy

Learn Computer Science

  • Algorithms
  • Data Structures
  • Coding Questions
  • Graph Theory
  • Hiring
  • Contact

Graph Theory

Topics

  • Bipartite Graph
  • Euler Path and Euler Circuit
  • Hamiltonian Graph
  • 6 Color Theorem
  • 5 Color Theorem

Proofs

  • Every tree is planar
  • Every tree is a bipartite graph
  • Every Bipartite Graph is Perfect
  • Every bipartite graph is 2 chromatic
  • Hypercube is Hamiltonian
  • Hypercube is Bipartite
  • Every tree is a bipartite graph
  • A graph is bipartite if and only if it does not have a cycle of odd length
  • A bipartite graph has a unique bipartition if and only if it is connected
  • Petersen Graph is nonplanar
  • Petersen Graph is not Hamiltonian
  • Complete graph K4 is planar

Thanks for visiting this site. If you face any problem or find any error feel free to contact us.

Copyright © 2023 SlayStudy
Privacy Policy