Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Graph enumeration

Known as: Enumeration of graphs, Graphical enumeration 
In combinatorics, an area of mathematics, graph enumeration describes a class of combinatorial enumeration problems in which one must count… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
An apparatus for ganging and cutting a plurality of layers of strip material in predetermined lengths includes a frame supporting… Expand
  • figure 3.19
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We discuss the parametrized complexity of counting and evaluation problems on graphs where the range of counting is denable in… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
INTRODUCTION A Systematic Design Methodology Links and Joints Kinematic Chains, Mechanisms, and Machines Kinematics of Mechanisms… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Babel and Olariu (1995) introduced the class of (q, t) graphs in which every set of q vertices has at most t distinct induced P4s… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
12 Large singularities of analytic functions 113 12.1 The saddle point 13 Multivariate generating functions 128 14 Mellin and… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Presents an efficient computational structure for preattentive perceptual organization. By perceptual organization the authors… Expand
Is this relevant?
1989
1989
Presentation de nouvelles formulations multiperiodes a programmation lineaire, appliquees a des unites de production constituees… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1980
Highly Cited
1980
We present a method for counting closed graphs on a compact Riemannian surface, based on techniques suggested by quantum field… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1973
Highly Cited
1973
What do you do to start reading graphical enumeration? Searching the book that you love to read first or find an interesting book… Expand
Is this relevant?