Hostname: page-component-7b7567c8c-slfcl Total loading time: 0 Render date: 2026-11-19T17:32:19.239Z Has data issue: false hasContentIssue false

On Kelly's congruence theorem for trees

Published online by Cambridge University Press:  24 October 2008

J. A. Bondy
Affiliation:
Mathematical Institute, Oxford
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A graph G is a pair (V{G), E(G)); V(G) is the set of vertices of G, and E(G) the set of edges of G; E(G) is a subset of the Cartesian product V(G) × V(G) (all pairs (υi, υj) where υi∈ V(G), υj ∈ V(G)). If υ is a vertex of G we shall write υ ∈ G. The graph-theoretic terminology used in this paper is that of Berge (1). We shall consider only graphs which are finite, undirected, and without loops.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1969