A friend asked me to help her answer exercises about this topic, which I never encountered before. And after watching this video, I can totally answer those exercises sooo thank you!
@@MzMath i really appreciate your help! before this video, i was watching ten minute long videos that didn't cover the topic as well as you did. Keep it up!
Angela Locke MGF 1107 21Z (Fall 2019) Watching the coloring of the vertex' starting at 1:42 was very helpful to understand. Especially when you explained that "the vertex of the highest degree is degree 5, so we'll start by coloring that one." Thank you for the video to visually connect the definitions to better understand.
Julieth Alvarez MGF1107 21Z Fall 2019 Watching this video helped understand the coloring of graph a lot easier because working this section I remembered having difficulty figuring it out. The quote I chose from this video is "Choose a vertex with the highest degree, and color it. Use the same color to color as many vertices as you can without coloring vertices joined by an edge of the same color."
Thanks for this explanation Ms Hearn, I have a question, the step 1 when start coloring a graph you said we have to choose the vertex with the highest degree, why can't we choose a random vertex without taking into account the vertex degree? I ask because I've watched some videos as the rule is starting coloring the vertex with the highest degree but I don't get why the reason is.
Hi! Thank you very much for this video! I would like to use it in my unversity works, but i really need to get this algorithm`s name. Could you help me please?
sarah kimble MGF1107 fall 2018 well explained! actually enjoyed this part of the class. pretty cool to know that coloring maps is used for the study of cell phone traffic.
Courtney D. MGF1107 21Z Fall 2019 "The coloring of graphs is used to sove practical problems such as: Scheduling problems in management science" I wish I saw this before the test, glad I get it now for the final though!
Hi, I'm a math teacher and I'm currently on this curriculum. I've noticed that this technique does not always work. I have a specific graph that can give me 4 or 3 depending which one is colored. Maybe I'm missing something. Would you like me to send it to you?
Sure! I'd love to take a look. I am actually working on a chapter of Graph Theory right now. This would be helpful. You can email me at ms.hearn.math@gmail.com.
Baylee Dlouhy MGF 1107 21Z (Fall 2019) "If you experiment with different colorings, you will find it's chromatic number is 3 as it appears to be in the graph above."
Oh my god you are awesome god bless u iam thankful from my heart to you thanks very very much for that easy and understandable explanation you are incredible
William Aaron Rhodes MGF 1107 217 (Fall 2019) "The chromatic number of a graph is the least number of colors needed to make a coloring. Thank you for sharing!
Amazing. Simple and straightforward explanation. Thank you!
Thanks for the positive feedback! :-)
A friend asked me to help her answer exercises about this topic, which I never encountered before. And after watching this video, I can totally answer those exercises sooo thank you!
That’s awesome! 👍 👏
one of the vertex points has degree 4, not three. it doesn't change the chromatic number, but it does change the coloring that is shown in the video
Thanks, Julia! I need to fix that. :-)
You literally saved me for my online class. I learned a lot from this 3min. vid. rather than my 1 hour class lmao. Thank you.
I'm so glad!
simple and quick, and you provide more than enough information to understand the topic.
Thanks! I appreciate the positive feedback.
@@MzMath i really appreciate your help! before this video, i was watching ten minute long videos that didn't cover the topic as well as you did. Keep it up!
Thankyou so much the content is short and perfect :)
You're very welcome! Thanks for watching! 👍😁
Angela Locke
MGF 1107 21Z (Fall 2019)
Watching the coloring of the vertex' starting at 1:42 was very helpful to understand. Especially when you explained that "the vertex of the highest degree is degree 5, so we'll start by coloring that one." Thank you for the video to visually connect the definitions to better understand.
thank you so much! this was very easy to understand, so simply explained :)
You're very welcome!
You better be my prof for this class! It took me less than 3 minutes to understand the whole concept compare to my prof with 30 minutes to get a mess!
Thanks for watching and for the positive feedback!
Yay! I can answer chromatic questions with confidence now! :D
Great! That's awesome! 👍😁
Julieth Alvarez
MGF1107 21Z
Fall 2019
Watching this video helped understand the coloring of graph a lot easier because working this section I remembered having difficulty figuring it out. The quote I chose from this video is "Choose a vertex with the highest degree, and color it. Use the same color to color as many vertices as you can without coloring vertices joined by an edge of the same color."
Thanks for this explanation Ms Hearn, I have a question, the step 1 when start coloring a graph you said we have to choose the vertex with the highest degree, why can't we choose a random vertex without taking into account the vertex degree? I ask because I've watched some videos as the rule is starting coloring the vertex with the highest degree but I don't get why the reason is.
What a great question!
I have responded with a video. ruclips.net/video/rPo-8YsOFII/видео.html
Thanks for watching!
Thank you so much! You helped me a lot! Coz I'm struggling with how to assign colors correctly. These steps help me somehow.
I am so happy to hear that it helped! Thank you for watching. :-)
This video helped me a lot. Very well done.
how about the point that dont connect to any other point? what should i color it? a different color that no point got it? or same as any point color?
Great question! If it’s not adjacent to any other point, you can use any of the existing colors. Don’t use a new color.
@@MzMath thank you! ❤️
that was soo clear thank you so much
one vertex in the example has a degree of 4, one located in the lower right hand side
Thanks! Yes, you are right. I just wish there were a way to update it without taking the video down and starting over.
Very clear explanation!
Glad you think so!
Hi! Thank you very much for this video! I would like to use it in my unversity works, but i really need to get this algorithm`s name. Could you help me please?
That's a good question. I am not familiar with the name of the algorithm.
Jenniffer Nichols
MGF 1107 @ 9:30 MF
Coloring graphs and identify the chromatic
Thank you Mam for this excellent lecture
You at very welcome! ☺️ Thanks for watching!
sarah kimble
MGF1107 fall 2018
well explained! actually enjoyed this part of the class. pretty cool to know that coloring maps is used for the study of cell phone traffic.
Courtney D.
MGF1107 21Z
Fall 2019
"The coloring of graphs is used to sove practical problems such as:
Scheduling problems in management science"
I wish I saw this before the test, glad I get it now for the final though!
Hi, I'm a math teacher and I'm currently on this curriculum. I've noticed that this technique does not always work. I have a specific graph that can give me 4 or 3 depending which one is colored. Maybe I'm missing something. Would you like me to send it to you?
Sure! I'd love to take a look. I am actually working on a chapter of Graph Theory right now. This would be helpful. You can email me at ms.hearn.math@gmail.com.
IN 2:19 THERE IS A BIG MISTAKE:
Second point from bottom right
Degree is 4, so you should choose IT as the second coloring!!!!!!!
I agree. One of these days I will fix it. :-)
Baylee Dlouhy
MGF 1107 21Z (Fall 2019)
"If you experiment with different colorings, you will find it's chromatic number is 3 as it appears to be in the graph above."
Oh my god you are awesome god bless u iam thankful from my heart to you thanks very very much for that easy and understandable explanation you are incredible
So nice of you! I am glad it helped. You are very welcome. :-)
Thank you. This helped me solve a challenge on CodeWars :)
That's awesome! I am glad to hear it. Way to go!
Thank you!
You're welcome! Thanks for watching! 👍😁
THANK U SO MUCH
Savanna Goodwin
MGF1107 21Z
Fall 2019
"All of the remaining verticies are joined to those same red verticies by the same edge"
Thanks
Welcome! Thank you for watching!
Dashaun Malone
MGF1107 21Z
Fall 2019
"Anyone of them will work. I pick this one, and I'll color it blue."
William Aaron Rhodes
MGF 1107 217 (Fall 2019)
"The chromatic number of a graph is the least number of colors needed to make a coloring.
Thank you for sharing!
😃👍
Thanks!
Can I have your insta I'd??
Hi! I don't have an Instagram account. Thanks for watching!
@@MzMath I need to contact you !
You can email me if you prefer. ms.hearn.math@gmail.com