Jump to content

Graph enumeration

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Altenmann (talk | contribs) at 00:15, 11 March 2007 (←Created page with ''''Graph enumeration''' is a subject of graph theory that deals with the problems of the following type: find how many non-isomorphic graphs have a given pr...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Graph enumeration is a subject of graph theory that deals with the problems of the following type: find how many non-isomorphic graphs have a given property.

References

  • Frank Harary and Edgar M. Palmer (1973). Graphical Enumeration. Academic Press . ISBN 0123242452.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Graph_enumeration&oldid=114179438"