A note on circuit graphs (Q2380421)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on circuit graphs |
scientific article |
Statements
A note on circuit graphs (English)
0 references
26 March 2010
0 references
Summary: We give a short proof of \textit{Z. Gao} and \textit{R.B. Richter}'s theorem [``2-walks in circuit graphs'', J. Comb. Theor., Ser. B 62, No.\,2, 259--267 (1994; Zbl 0807.05027)] that every circuit graph contains a closed walk visiting each vertex once or twice.
0 references
circuit graph
0 references
closed walk
0 references
