A note on the total number of double Eulerian circuits in multigraphs.
Journal of Integer Sequences [electronic only] (2002)
- Volume: 5, Issue: 2, page Art. 02.2.5, 3 p., electronic only-Art. 02.2.5, 3 p., electronic only
- ISSN: 1530-7638
Access Full Article
top
How to cite
topLiskovets, Valery. "A note on the total number of double Eulerian circuits in multigraphs.." Journal of Integer Sequences [electronic only] 5.2 (2002): Art. 02.2.5, 3 p., electronic only-Art. 02.2.5, 3 p., electronic only. <http://eudml.org/doc/50006>.
@article{Liskovets2002,
author = {Liskovets, Valery},
journal = {Journal of Integer Sequences [electronic only]},
keywords = {double eulerian circuit; symmetric multidigraph; labeled vertices; root},
language = {eng},
number = {2},
pages = {Art. 02.2.5, 3 p., electronic only-Art. 02.2.5, 3 p., electronic only},
publisher = {School of Computer Science, University of Waterloo, Waterloo},
title = {A note on the total number of double Eulerian circuits in multigraphs.},
url = {http://eudml.org/doc/50006},
volume = {5},
year = {2002},
}
TY - JOUR
AU - Liskovets, Valery
TI - A note on the total number of double Eulerian circuits in multigraphs.
JO - Journal of Integer Sequences [electronic only]
PY - 2002
PB - School of Computer Science, University of Waterloo, Waterloo
VL - 5
IS - 2
SP - Art. 02.2.5, 3 p., electronic only
EP - Art. 02.2.5, 3 p., electronic only
LA - eng
KW - double eulerian circuit; symmetric multidigraph; labeled vertices; root
UR - http://eudml.org/doc/50006
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.