Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts
An Euler tour of a hypergraph is a closed walk that traverses every edge exactly once; if a hypergraph admits such a walk, then it is called eulerian. Although this notion is one of the progenitors of graph theory --- dating back to the eighteenth century --- treatment of this subject has only begu...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
Université d'Ottawa / University of Ottawa
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/39092 http://dx.doi.org/10.20381/ruor-23340 |