The number of Euler tours of a random $d$-in/$d$-out graph (2010)
Attributed to:
The complexity of valued constraints
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.46298/dmtcs.2787
Publication URI: http://dx.doi.org/10.46298/dmtcs.2787
Type: Journal Article/Review
Parent Publication: Discrete Mathematics & Theoretical Computer Science
Issue: Proceedings