Counting domino trains

zbMATH Open1322.05066arXiv0902.4084MaRDI QIDQ2948675FDOQ2948675

Authors: Antonio M. Oller Marcén 

Publication date: 6 October 2015

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.

Full work available at URL: https://arxiv.org/abs/0902.4084

Recommendations

• Euler tours and a game with dominoes
• Counting dominating sets in cactus chains
• scientific article; zbMATH DE number 426356
• On the number of Euler trails in directed graphs
• A formula for the content of a domino of three faces

zbMATH Keywords

Eulerian cyclesEulerian paths

Mathematics Subject Classification ID

Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Enumeration in graph theory (05C30) Paths and cycles (05C38) Combinatorial games (91A46)

Cited In (2)

• Counting train track layouts
• Title not available (Why is that?)

This page was built for publication: Counting domino trains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948675)