A ring in graph theory
- 1 January 1947
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 43 (1), 26-40
- https://doi.org/10.1017/s0305004100023173
Abstract
We call a point set in a complex K a 0-cell if it contains just one point of K, and a 1-cell if it is an open arc. A set L of 0-cells and 1-cells of K is called a linear graph on K if(i) no two members of L intersect,(ii) the union of all the members of L is K,(iii) each end-point of a 1-cell of L is a 0-cell of Land (iv) the number of 0-cells and 1-cells of L is finite and not 0.Keywords
This publication has 1 reference indexed in Scilit:
- A logical expansion in mathematicsBulletin of the American Mathematical Society, 1932