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.
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/}
}
Cité par Sources :