We give a short proof of Gao and Richter's theorem that every circuit graph contains a closed walk visiting each vertex once or twice.
科研之友
微信
新浪微博
Facebook
分享链接
