Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
From MaRDI portal
Publication:1297626
DOI10.1007/BF02879060zbMath0929.05018MaRDI QIDQ1297626
Could not fetch data.
Publication date: 25 January 2000
Published in: (Search for Journal in Brave)
Could not fetch data.
Could not fetch data.