Algorithms for generating labelled graphs with given degree

Algorithms for generating labelled graphs with given degree

0.00 Avg rating0 Votes
Article ID: iaor19921078
Country: Netherlands
Volume: 37
Start Page Number: 187
End Page Number: 194
Publication Date: Nov 1991
Journal: Journal of Computational and Applied Mathematics
Authors: ,
Abstract:

Using an isomorphism, due to Burge, between Young tableaux of special shape and (undirected) labelled graphs without loops or multiple edges, the authors describe an algorithm to generate such graphs.

Reviews

Required fields are marked *. Your email address will not be published.