All degrees of vertices in an undirected graph are equal to 2k.

[Michael Krowford]

All degrees of vertices in an undirected graph are equal to 2k. All of its ribs are painted in several colors. Find an O(|V| + |E|) algorithm (where E is the set of edges, V is the set of vertices) that finds in this graph the Euler cycle in which the colors of all neighboring edges are different (or outputs that there is no such cycle).

 

[Deleted member 4993]

All degrees of vertices in an undirected graph are equal to 2k. All of its ribs are painted in several colors. Find an O(|V| + |E|) algorithm (where E is the set of edges, V is the set of vertices) that finds in this graph the Euler cycle in which the colors of all neighboring edges are different (or outputs that there is no such cycle).

Please show us what you have tried and exactly where you are stuck.

Please follow the rules of posting in this forum, as enunciated at:

https://www.freemathhelp.com/forum/threads/read-before-posting.109846/#post-486520

Please share your work/thoughts about this assignment.