A Note on Circuit Graphs

  • Qing Cui

Abstract

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.

Published
2010-01-31
Article Number
N10