Hello Readers Hope you are doing well. Today i am here with detailed discussion on Max Flow - Min Cut problems and solutions. For application part you can refer my previous post Network Flows: Max Flow + MinCut Theory. Consider the following situation why Max flow is required. From the above image it is clear … Continue reading Max Flow – Min Cut Theory

# Discreate Math

# Network Flows: Max Flow + MinCut Theory

Hello Readers Happy New Year 2018 Hope you are doing well. Today I am going to post a very very important topic of Graph theory that is Network Flows. Let us think two questions "What and Why" about Network Flows. Readers, just imagine you are a courier service provider and you have to deliver some … Continue reading Network Flows: Max Flow + MinCut Theory

# Five Color Theorem: Proof

Hello Readers, Have a nice day! In this post, i am writing on the proof of famous theorem known as "Five Color Theorem". Hope, you understood this proof. Thank you Stay Connected, Stay learned Dr. Namita Tiwari

# Decomposition Theorem to find Chromatic polynomial

Hello Readers, Hope you are doing well. This post is based on Decomposition Theorem that is very important to find out the chromatic Polynomials of given finite graphs. Let us understand this theorem with some examples. Hope you understood. Thank you for reading. Stay Connected, Stay learned. Dr. Namita Tiwari