Discussion @ 1320. Graph Decomposition @ Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

back to board

Discussion of Problem 1320. Graph Decomposition

This is a cool problem

Posted by YuYu8 15 Jan 2018 17:36

So, we can decompose like this any connected graph G = (V, E), |E| = 2k, k in Z+? This is lovely, this is nice (I proved it using induction, I'm proud of myself, yay!).

Re: This is a cool problem

Posted by Arseniy_Pavlov 18 May 2019 19:02

I came up to this idea, but failed to proof.