Skip to main content Accesibility Help
×
×
Home

A family of cubical graphs

  • W. T. Tutte (a1)
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.

Copyright
References
Hide All

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

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

Dénes König, p. 202.

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

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

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

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Proceedings of the Cambridge Philosophical Society
  • ISSN: 0305-0041
  • EISSN: 1469-8064
  • URL: /core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed