1. The asymptotic number of labelled graphs with given degree sequence;Bender;J. Combin. Theory A,1978
2. D.G. Bobrow, M. Brady (Eds.), in: T. Hogg, B.A. Hubermann, C.P. Williams (Guest Eds.), Special Volume on Frontiers in Problem Solving: Phase Transitions and Complexity, North-Holland, Amsterdam, New York, Artificial Intelligence 81(1,2) (1996).
3. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs;Bollobás;Euro. J. Combin.,1980
4. Constraint networks;Dechter,1992
5. A sufficient condition for backtrack-free search;Freuder;J. ACM,1982