A Note on Circuit Graphs

  • Qing Cui
DOI: https://doi.org/10.37236/459

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
How to Cite
Cui, Q. (2010). A Note on Circuit Graphs. The Electronic Journal of Combinatorics, 17(1), N10. https://doi.org/10.37236/459
Issue
Volume 17 (2010)
Article Number
N10