Greedy Coloring Algorithm, Bipartite, Planar, and Span 【Graph Theory】
1The magnanimous chromatic number, Euler's theorem (one of 'em)\n
CORRECTION:
- I was supposed to make a 1-regular spanning graph, what I made is not it, as only the start and end nodes are of degree 1
\nDonation (DoNut?) link: https://streamelements.com/scikous/tip \n\nSide note:\n- ChatGPT (assist)\n\n----------------------------------------------------------------\nStuff (If not here or in About, then is not me):\nTascker App (developed by me, Android ONLY): https://play.google.com/store/apps/details?id=com.firomazu.tascker\nKick.com: https://kick.com/Scikous\nGitHub: https://github.com/Scikous\nTwitter: https://twitter.com/Scikous\nPixiv: https://www.pixiv.net/en/users/76494293\n----------------------------------------------------------------\nTags:\n#maths #vtuber #vtuberen #study #graphtheory #nodes