Keyword

graph enumeration

Description: Graph enumeration is a branch of combinatorics that counts graphs satisfying specified structural properties or constraints.

Primary topic: Graph theory and applications (26%)

Wikidata ID: wiki/Q5597086

OpenAlex ID: keywords/graph-enumeration

Random Graphs

2001 · Béla Bollobás · Cambridge University Press eBooks · 2,631

Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen

1937 · G. Pólya · Acta Mathematica · 1,009

PDF

Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem

1971 · H. N. V. Temperley, Elliott H Lieb · Proceedings of the Royal Society of London A Mathematical and Physical Sciences · 1,002

Advanced Combinatorics: The Art of Finite and Infinite Expansions

1974 · Louis Comtet, J.W. Nienhuys · CERN Document Server (European Organization for Nuclear Research) · 883

Graphical Enumeration

1973 · Elsevier eBooks · 834

On generating all maximal independent sets

1988 · David S. Johnson, Mihalis Yannakakis, et al. · Information Processing Letters · 772

Quantum field theory techniques in graphical enumeration

1980 · D Bessis, C Itzykson, et al. · Advances in Applied Mathematics · 589

Threshold Graphs and Related Topics

1995 · Annals of discrete mathematics · 493

Acyclic orientations of graphs

1973 · Richard P. Stanley · Discrete Mathematics · 422

PDF

The Tutte Polynomial and Its Applications

1992 · Thomas Brylawski, James Oxley · Cambridge University Press eBooks · 382

Counting unlabeled acyclic digraphs

1977 · R. W. Robinson · Lecture notes in mathematics · 377

Wiener Index of Hexagonal Systems

2002 · Andrey A. Dobrynin, Ivan Gutman, et al. · Acta Applicandae Mathematicae · 322

Oceanographical engineering

1965 · William G. Van Dorn · Journal of the Franklin Institute · 308

A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees

2011 · Joseph Blitzstein, Persi Diaconis · Internet Mathematics · 291

PDF

On the number of complete subgraphs contained in certain graphs

1981 · R.J Evans, J.R Pulham, et al. · Journal of Combinatorial Theory Series B · 286

Constructing cospectral graphs

1982 · C. D. Godsil, B. D. McKay · Aequationes Mathematicae · 251

Generating Random Regular Graphs Quickly

1999 · A. STEGER, N. C. WORMALD · Combinatorics Probability Computing · 236

Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence

2005 · Fabien Viger, Matthieu Latapy · Lecture notes in computer science · 235

Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations

1978 · Ronald C. Read · Annals of discrete mathematics · 232

Enumeration of cospectral graphs

2003 · Willem H. Haemers, Edward Spence · European Journal of Combinatorics · 207

PDF

On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

2001 · B. Courcelle, J.A. Makowsky, et al. · Discrete Applied Mathematics · 205

PDF

Enumeration of periodic tetrahedral frameworks. II. Polynodal graphs

2004 · M.M.J. Treacy, I. Rivin, et al. · Microporous and Mesoporous Materials · 203

Planar Maps are Well Labeled Trees

1981 · Robert Cori, Bernard Vauquelin · Canadian Journal of Mathematics · 201

PDF

House of Graphs: A database of interesting graphs

2012 · Gunnar Brinkmann, Kris Coolsaet, et al. · Discrete Applied Mathematics · 184

Eigenvalue bounds for the signless laplacian

2007 · Dragos Cvetkovic, Peter Rowlinson, et al. · Publications de l Institut Mathematique · 184

PDF

Works count: 4,673

Citation count: 41,970