Counting the 10‐point graphs by partition

R. C. Read; N. C. Wormald

doi:10.1002/jgt.3190050208

Counting the 10‐point graphs by partition

R. C. Read, N. C. Wormald

Research output: Contribution to journal › Article › Research › peer-review

3 Citations (Scopus)

Abstract

In this paper we discuss old and new theoretical methods for computing the number of graphs with a given partition. We also show how a judicious combination of these methods gives rise to a procedure that is sufficiently powerful to make possible the enumeration of all graphs on 10 points according to their partitions.

Original language	English
Pages (from-to)	183-196
Number of pages	14
Journal	Journal of Graph Theory
Volume	5
Issue number	2
DOIs	https://doi.org/10.1002/jgt.3190050208
Publication status	Published - 1981
Externally published	Yes

Access to Document

10.1002/jgt.3190050208

Cite this

@article{0245e0a84d97411c9da125b935d5fe46,

title = "Counting the 10‐point graphs by partition",

abstract = "In this paper we discuss old and new theoretical methods for computing the number of graphs with a given partition. We also show how a judicious combination of these methods gives rise to a procedure that is sufficiently powerful to make possible the enumeration of all graphs on 10 points according to their partitions.",

author = "Read, {R. C.} and Wormald, {N. C.}",

year = "1981",

doi = "10.1002/jgt.3190050208",

language = "English",

volume = "5",

pages = "183--196",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "John Wiley & Sons",

number = "2",

}

TY - JOUR

T1 - Counting the 10‐point graphs by partition

AU - Read, R. C.

AU - Wormald, N. C.

PY - 1981

Y1 - 1981

N2 - In this paper we discuss old and new theoretical methods for computing the number of graphs with a given partition. We also show how a judicious combination of these methods gives rise to a procedure that is sufficiently powerful to make possible the enumeration of all graphs on 10 points according to their partitions.

AB - In this paper we discuss old and new theoretical methods for computing the number of graphs with a given partition. We also show how a judicious combination of these methods gives rise to a procedure that is sufficiently powerful to make possible the enumeration of all graphs on 10 points according to their partitions.

UR - http://www.scopus.com/inward/record.url?scp=84986434698&partnerID=8YFLogxK

U2 - 10.1002/jgt.3190050208

DO - 10.1002/jgt.3190050208

M3 - Article

AN - SCOPUS:84986434698

VL - 5

SP - 183

EP - 196

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -

Counting the 10‐point graphs by partition

Abstract

Access to Document

Other files and links

Cite this