Counting domino trains

Simple item page
dc.creatorOller-Marcen, Antonio M.
dc.date2009-02-24
dc.date.accessioned2026-07-07T12:46:11Z
dc.date.available2026-07-07T12:46:11Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/0902.4084
dc.identifierhttp://arxiv.org/abs/0902.4084
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/221295
dc.subjectCombinatorics
dc.subjectHistory and Overview
dc.titleCounting domino trains
dc.typetext

Files

Collections

arXiv