Counting domino trains
Combinatorics
2009-02-25 v1 History and Overview
Abstract
In this paper we present a way to count the number of trains that we can construct with a given set of domino pieces. As an application we obtain a new method to compute the total number of eulerian paths in an undirected graph as well as their starting and ending vertices.
Cite
@article{arxiv.0902.4084,
title = {Counting domino trains},
author = {Antonio M. Oller-Marcen},
journal= {arXiv preprint arXiv:0902.4084},
year = {2009}
}