A note on circuit graphs
The electronic journal of combinatorics, Tome 17 (2010)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
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.
DOI : 10.37236/459
Classification : 05C38, 05C40
Mots-clés : circuit graph, closed walk
Qing Cui. A note on circuit graphs. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/459
@article{10_37236_459,
     author = {Qing Cui},
     title = {A note on circuit graphs},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/459},
     zbl = {1184.05071},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/459/}
}
TY  - JOUR
AU  - Qing Cui
TI  - A note on circuit graphs
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/459/
DO  - 10.37236/459
ID  - 10_37236_459
ER  - 
%0 Journal Article
%A Qing Cui
%T A note on circuit graphs
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/459/
%R 10.37236/459
%F 10_37236_459

Cité par Sources :