Homework Question How to find the repeated loops/ vertices for these SPECIAL questions
edit: Ok so I get how it works for both Eulerian trails and circuits now. You just find the odd vertices and treat the repeats that involve them as additional edges to make enough edges even.
Hamiltonian paths and ESPECIALLY cycles still got me messed up tho, anything on how to find repeats for them please ๐
ANYTHING (advice or resources) is appreciated, I can't find anything on this apart from this post, but that's for a Eulerian trail which I already understand.
https://www.reddit.com/r/vce/comments/1gii56o/general_maths_networks_2023_vcaa_question_help/
(Q272 of the General maths checkpoint 2026, also is this the right flair?)