Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/112477| Title: | On a determinant formula for enumerating Euler trails in a class of digraphs |
| Authors: | Lauri, Josef |
| Keywords: | Eulerian graph theory Graph theory Directed graphs Mathematics -- Charts, diagrams, etc. |
| Issue Date: | 1999 |
| Citation: | Lauri, J. (1999, November). On a determinant formula for enumerating Euler trails in a class of digraphs. 5th Workshop in Combinatorics, Italy. |
| Abstract: | In 1996 Macris and Pule obtained a new determinant formula for the number of Euler trails in a special class of digraphs. An elementary combinatorial proof of this result was given in. In this note we shall discuss possible extensions and generalisations of this result. Many of these observations are, as yet, in a very inconclusive state and they are being put forward here in the spirit of a workshop session in the hope that some participants might find ways of bringing some of these ideas to fruition. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/112477 |
| Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| On_a_determinant_formula_for_enumerating_Euler_trails_in_a_class_of_digraphs_1999.pdf Restricted Access | 175.49 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.