Counting domino trains
Antonio M. Oller-Marcen
TL;DR
This paper introduces a novel method for counting domino trains and applies it to efficiently compute the number of Eulerian paths in undirected graphs, including their start and end vertices.
Contribution
It presents a new approach to counting domino trains and leverages this to determine Eulerian paths in graphs, connecting domino puzzles with graph theory.
Findings
New method for counting domino trains
Efficient computation of Eulerian paths and vertices
Application to graph theory problems
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Graph Labeling and Dimension Problems · Advanced Graph Theory Research