Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-26T08:49:18.509Z Has data issue: false hasContentIssue false
  • English
  • Français

A family of cubical graphs

Published online by Cambridge University Press:  24 October 2008

W. T. Tutte
W. T. Tutte
Affiliation:
Trinity CollegeCambridge
Get access Rights & Permissions [Opens in a new window]

Extract

We begin with some definitions.

A cubical graph is a simplicial 1-complex in which each 0-simplex is incident with just three 1-simplexes.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 43 , Issue 4 , October 1947 , pp. 459 - 474
Copyright
Copyright © Cambridge Philosophical Society 1947

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

* König, Dénes, Theorie der Endlichen und Unendlichen Graphen (Leipzig, 1936), p. 197; Figs. 92a and 92b.Google Scholar

* Dénes König, p. 194, Fig. 91.Google Scholar

† Dénes König, p. 202.Google Scholar

‡ Franklin, P., J. Math. Phys. 14 (1935), 228–31.Google Scholar

½ Ball, W. W. Rouse, Mathematical Recreations (11th ed., New York, 1939), p. 235.Google Scholar

* I.e. consisting of just ½m−½ 1-simplexes of N.Google Scholar