#### Filter Results:

#### Publication Year

1983

2012

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

#### Brain Region

#### Organism

Learn More

- A G Chetwynd, A J W Hilton
- 1985

It is a well-known conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) ^ n, then G is the union of edge-disjoint 1-factors. It is well known that this conjecture is true for d(G) equal to 2n —1 or 2n — 2. We show here that it is true for d(G) equal to2n — 3, In — 4, or2n — 5. We also show that it is true for </(G)>$|K(G)|.

Methods for the statistical analysis of stationary spatial point process data are now well established, methods for nonstationary processes less so. One of many sources of nonstationary point process data is a case-control study in environmental epidemiology. In that context, the data consist of a realization of each of two spatial point processes… (More)

- A G Chetwynd, A J W Hilton
- 2007

1. Introduction The graphs we consider here are either simple graphs, that is they have no loops or multiple edges, or are multigraphs, that is they may have more than one edge joining a pair of vertices, but again have no loops. In particular we shall consider a special kind of multigraph, called a star-multigraph: this is a multigraph which contains a… (More)